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-1cceb4a [2018-01-29 22:46:04,431 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:46:04,433 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:46:04,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:46:04,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:46:04,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:46:04,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:46:04,450 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:46:04,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:46:04,452 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:46:04,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:46:04,453 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:46:04,453 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:46:04,454 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:46:04,455 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:46:04,458 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:46:04,460 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:46:04,462 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:46:04,463 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:46:04,464 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:46:04,467 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:46:04,467 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:46:04,467 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:46:04,468 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:46:04,469 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:46:04,470 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:46:04,471 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:46:04,471 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:46:04,472 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:46:04,472 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:46:04,472 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:46:04,473 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-29 22:46:04,482 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:46:04,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:46:04,484 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:46:04,484 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:46:04,484 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:46:04,484 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:46:04,484 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:46:04,485 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:46:04,485 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:46:04,486 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:46:04,486 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:46:04,486 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:46:04,486 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:46:04,486 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:46:04,487 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:46:04,487 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:46:04,487 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:46:04,487 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:46:04,487 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:46:04,488 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:46:04,488 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:46:04,488 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:46:04,488 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:46:04,488 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:46:04,489 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:46:04,489 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:46:04,489 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:46:04,489 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:46:04,489 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:46:04,490 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:46:04,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:46:04,490 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:46:04,491 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:46:04,491 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:46:04,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:46:04,548 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:46:04,552 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:46:04,554 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:46:04,555 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:46:04,555 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-29 22:46:04,742 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:46:04,747 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:46:04,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:46:04,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:46:04,754 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:46:04,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:46:04" (1/1) ... [2018-01-29 22:46:04,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@741a0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:46:04, skipping insertion in model container [2018-01-29 22:46:04,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:46:04" (1/1) ... [2018-01-29 22:46:04,773 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:46:04,814 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:46:04,939 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:46:04,961 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:46:04,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:46:04 WrapperNode [2018-01-29 22:46:04,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:46:04,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:46:04,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:46:04,971 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:46:04,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:46:04" (1/1) ... [2018-01-29 22:46:04,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:46:04" (1/1) ... [2018-01-29 22:46:04,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:46:04" (1/1) ... [2018-01-29 22:46:04,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:46:04" (1/1) ... [2018-01-29 22:46:05,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:46:04" (1/1) ... [2018-01-29 22:46:05,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:46:04" (1/1) ... [2018-01-29 22:46:05,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:46:04" (1/1) ... [2018-01-29 22:46:05,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:46:05,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:46:05,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:46:05,011 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:46:05,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:46:04" (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-29 22:46:05,067 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:46:05,067 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:46:05,067 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-01-29 22:46:05,067 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:46:05,068 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:46:05,068 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:46:05,068 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:46:05,068 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:46:05,068 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:46:05,068 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:46:05,068 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-01-29 22:46:05,068 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:46:05,068 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:46:05,068 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:46:05,318 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:46:05,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:46:05 BoogieIcfgContainer [2018-01-29 22:46:05,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:46:05,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:46:05,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:46:05,321 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:46:05,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:46:04" (1/3) ... [2018-01-29 22:46:05,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e88aed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:46:05, skipping insertion in model container [2018-01-29 22:46:05,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:46:04" (2/3) ... [2018-01-29 22:46:05,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e88aed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:46:05, skipping insertion in model container [2018-01-29 22:46:05,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:46:05" (3/3) ... [2018-01-29 22:46:05,324 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:46:05,331 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:46:05,339 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-29 22:46:05,381 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:46:05,381 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:46:05,381 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:46:05,381 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:46:05,382 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:46:05,382 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:46:05,382 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:46:05,382 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:46:05,383 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:46:05,404 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-01-29 22:46:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:46:05,410 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:05,411 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:46:05,411 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:05,415 INFO L82 PathProgramCache]: Analyzing trace with hash 190942389, now seen corresponding path program 1 times [2018-01-29 22:46:05,417 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:05,417 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:05,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:05,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:05,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:05,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:05,633 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-29 22:46:05,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:05,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:46:05,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:46:05,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:46:05,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:46:05,735 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 4 states. [2018-01-29 22:46:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:05,879 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2018-01-29 22:46:05,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:46:05,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-29 22:46:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:05,888 INFO L225 Difference]: With dead ends: 117 [2018-01-29 22:46:05,889 INFO L226 Difference]: Without dead ends: 83 [2018-01-29 22:46:05,892 INFO L553 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-29 22:46:05,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-29 22:46:05,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-29 22:46:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-29 22:46:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-29 22:46:05,926 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 19 [2018-01-29 22:46:05,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:05,926 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-29 22:46:05,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:46:05,927 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-29 22:46:05,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:46:05,927 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:05,927 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:46:05,928 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:05,928 INFO L82 PathProgramCache]: Analyzing trace with hash 190942390, now seen corresponding path program 1 times [2018-01-29 22:46:05,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:05,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:05,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:05,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:05,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:05,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:06,089 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-29 22:46:06,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:06,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:46:06,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:46:06,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:46:06,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:46:06,092 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2018-01-29 22:46:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:06,144 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-29 22:46:06,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:46:06,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-29 22:46:06,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:06,146 INFO L225 Difference]: With dead ends: 83 [2018-01-29 22:46:06,147 INFO L226 Difference]: Without dead ends: 82 [2018-01-29 22:46:06,148 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:46:06,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-29 22:46:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-29 22:46:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-29 22:46:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-01-29 22:46:06,157 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 19 [2018-01-29 22:46:06,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:06,158 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-01-29 22:46:06,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:46:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-01-29 22:46:06,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 22:46:06,158 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:06,159 INFO L350 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-29 22:46:06,159 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:06,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1624246854, now seen corresponding path program 1 times [2018-01-29 22:46:06,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:06,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:06,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:06,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:06,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:06,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:06,221 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-29 22:46:06,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:06,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:46:06,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:46:06,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:46:06,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:46:06,222 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 4 states. [2018-01-29 22:46:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:06,272 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-01-29 22:46:06,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:46:06,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-29 22:46:06,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:06,273 INFO L225 Difference]: With dead ends: 82 [2018-01-29 22:46:06,274 INFO L226 Difference]: Without dead ends: 81 [2018-01-29 22:46:06,274 INFO L553 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-29 22:46:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-29 22:46:06,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-29 22:46:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-29 22:46:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-01-29 22:46:06,283 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 20 [2018-01-29 22:46:06,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:06,283 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-01-29 22:46:06,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:46:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-01-29 22:46:06,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 22:46:06,284 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:06,284 INFO L350 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-29 22:46:06,285 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:06,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1624246855, now seen corresponding path program 1 times [2018-01-29 22:46:06,285 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:06,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:06,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:06,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:06,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:06,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:06,372 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-29 22:46:06,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:06,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:46:06,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:46:06,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:46:06,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:46:06,373 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 5 states. [2018-01-29 22:46:06,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:06,407 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-01-29 22:46:06,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:46:06,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-29 22:46:06,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:06,409 INFO L225 Difference]: With dead ends: 81 [2018-01-29 22:46:06,409 INFO L226 Difference]: Without dead ends: 80 [2018-01-29 22:46:06,409 INFO L553 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-29 22:46:06,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-29 22:46:06,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-29 22:46:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-29 22:46:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-01-29 22:46:06,415 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 20 [2018-01-29 22:46:06,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:06,416 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-01-29 22:46:06,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:46:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-01-29 22:46:06,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 22:46:06,416 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:06,417 INFO L350 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-29 22:46:06,417 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:06,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1194008499, now seen corresponding path program 1 times [2018-01-29 22:46:06,417 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:06,417 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:06,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:06,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:06,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:06,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:06,494 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-29 22:46:06,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:06,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:46:06,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:46:06,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:46:06,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:46:06,496 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 6 states. [2018-01-29 22:46:06,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:06,596 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-01-29 22:46:06,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:46:06,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-29 22:46:06,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:06,599 INFO L225 Difference]: With dead ends: 107 [2018-01-29 22:46:06,600 INFO L226 Difference]: Without dead ends: 106 [2018-01-29 22:46:06,600 INFO L553 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-29 22:46:06,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-29 22:46:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2018-01-29 22:46:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-29 22:46:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-01-29 22:46:06,610 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 31 [2018-01-29 22:46:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:06,610 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-01-29 22:46:06,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:46:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-01-29 22:46:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 22:46:06,611 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:06,612 INFO L350 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-29 22:46:06,612 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:06,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1194008498, now seen corresponding path program 1 times [2018-01-29 22:46:06,612 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:06,612 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:06,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:06,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:06,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:06,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:06,757 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-29 22:46:06,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:06,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:46:06,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:46:06,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:46:06,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:46:06,758 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 9 states. [2018-01-29 22:46:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:06,941 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2018-01-29 22:46:06,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 22:46:06,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-29 22:46:06,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:06,943 INFO L225 Difference]: With dead ends: 106 [2018-01-29 22:46:06,943 INFO L226 Difference]: Without dead ends: 105 [2018-01-29 22:46:06,943 INFO L553 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-29 22:46:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-29 22:46:06,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2018-01-29 22:46:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-29 22:46:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2018-01-29 22:46:06,952 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 31 [2018-01-29 22:46:06,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:06,953 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2018-01-29 22:46:06,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:46:06,953 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2018-01-29 22:46:06,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-29 22:46:06,954 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:06,954 INFO L350 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-29 22:46:06,954 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:06,955 INFO L82 PathProgramCache]: Analyzing trace with hash 216843477, now seen corresponding path program 1 times [2018-01-29 22:46:06,955 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:06,955 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:06,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:06,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:06,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:06,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:07,112 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-29 22:46:07,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:07,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:46:07,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:46:07,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:46:07,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:46:07,113 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 7 states. [2018-01-29 22:46:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:07,296 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-01-29 22:46:07,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:46:07,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-29 22:46:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:07,298 INFO L225 Difference]: With dead ends: 107 [2018-01-29 22:46:07,298 INFO L226 Difference]: Without dead ends: 106 [2018-01-29 22:46:07,298 INFO L553 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-29 22:46:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-29 22:46:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2018-01-29 22:46:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-29 22:46:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-01-29 22:46:07,307 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 34 [2018-01-29 22:46:07,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:07,309 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-01-29 22:46:07,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:46:07,309 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-01-29 22:46:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-29 22:46:07,310 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:07,310 INFO L350 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-29 22:46:07,310 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:07,311 INFO L82 PathProgramCache]: Analyzing trace with hash 216843478, now seen corresponding path program 1 times [2018-01-29 22:46:07,311 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:07,311 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:07,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:07,312 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:07,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:07,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:07,445 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-29 22:46:07,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:07,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:46:07,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:46:07,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:46:07,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:46:07,447 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 10 states. [2018-01-29 22:46:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:07,647 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2018-01-29 22:46:07,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:46:07,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-29 22:46:07,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:07,649 INFO L225 Difference]: With dead ends: 111 [2018-01-29 22:46:07,649 INFO L226 Difference]: Without dead ends: 110 [2018-01-29 22:46:07,650 INFO L553 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-29 22:46:07,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-29 22:46:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 99. [2018-01-29 22:46:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-29 22:46:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-01-29 22:46:07,657 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 34 [2018-01-29 22:46:07,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:07,657 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-01-29 22:46:07,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:46:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-01-29 22:46:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 22:46:07,659 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:07,659 INFO L350 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-29 22:46:07,659 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:07,659 INFO L82 PathProgramCache]: Analyzing trace with hash -79052563, now seen corresponding path program 1 times [2018-01-29 22:46:07,659 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:07,660 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:07,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:07,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:07,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:07,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:07,734 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-29 22:46:07,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:07,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:46:07,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:46:07,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:46:07,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:46:07,736 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 7 states. [2018-01-29 22:46:07,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:07,828 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-01-29 22:46:07,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:46:07,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-01-29 22:46:07,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:07,829 INFO L225 Difference]: With dead ends: 105 [2018-01-29 22:46:07,829 INFO L226 Difference]: Without dead ends: 104 [2018-01-29 22:46:07,829 INFO L553 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-29 22:46:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-29 22:46:07,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-01-29 22:46:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-29 22:46:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2018-01-29 22:46:07,834 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 38 [2018-01-29 22:46:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:07,834 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2018-01-29 22:46:07,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:46:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-01-29 22:46:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 22:46:07,835 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:07,835 INFO L350 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-29 22:46:07,835 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:07,835 INFO L82 PathProgramCache]: Analyzing trace with hash -79052562, now seen corresponding path program 1 times [2018-01-29 22:46:07,836 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:07,836 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:07,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:07,836 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:07,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:07,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:07,966 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-29 22:46:07,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:07,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:46:07,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:46:07,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:46:07,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:46:07,967 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 10 states. [2018-01-29 22:46:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:08,116 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-01-29 22:46:08,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:46:08,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-01-29 22:46:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:08,117 INFO L225 Difference]: With dead ends: 116 [2018-01-29 22:46:08,117 INFO L226 Difference]: Without dead ends: 115 [2018-01-29 22:46:08,118 INFO L553 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-29 22:46:08,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-29 22:46:08,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2018-01-29 22:46:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-29 22:46:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-01-29 22:46:08,124 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 38 [2018-01-29 22:46:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:08,124 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-01-29 22:46:08,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:46:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-01-29 22:46:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 22:46:08,129 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:08,130 INFO L350 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-29 22:46:08,130 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:08,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1645468291, now seen corresponding path program 1 times [2018-01-29 22:46:08,130 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:08,130 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:08,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:08,131 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:08,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:08,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:08,171 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-29 22:46:08,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:08,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:46:08,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 22:46:08,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 22:46:08,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 22:46:08,173 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 3 states. [2018-01-29 22:46:08,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:08,186 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-01-29 22:46:08,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 22:46:08,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-01-29 22:46:08,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:08,187 INFO L225 Difference]: With dead ends: 119 [2018-01-29 22:46:08,187 INFO L226 Difference]: Without dead ends: 108 [2018-01-29 22:46:08,188 INFO L553 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-29 22:46:08,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-29 22:46:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2018-01-29 22:46:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-29 22:46:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-01-29 22:46:08,192 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 39 [2018-01-29 22:46:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:08,192 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-01-29 22:46:08,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 22:46:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-01-29 22:46:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 22:46:08,194 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:08,194 INFO L350 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-29 22:46:08,194 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:08,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1844337844, now seen corresponding path program 1 times [2018-01-29 22:46:08,194 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:08,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:08,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:08,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:08,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:08,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:08,511 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-29 22:46:08,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:08,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:46:08,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:46:08,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:46:08,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:46:08,512 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 10 states. [2018-01-29 22:46:08,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:08,731 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2018-01-29 22:46:08,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 22:46:08,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-29 22:46:08,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:08,732 INFO L225 Difference]: With dead ends: 117 [2018-01-29 22:46:08,733 INFO L226 Difference]: Without dead ends: 116 [2018-01-29 22:46:08,733 INFO L553 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-29 22:46:08,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-29 22:46:08,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2018-01-29 22:46:08,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-29 22:46:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2018-01-29 22:46:08,737 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 39 [2018-01-29 22:46:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:08,738 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2018-01-29 22:46:08,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:46:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2018-01-29 22:46:08,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 22:46:08,739 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:08,739 INFO L350 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-29 22:46:08,739 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:08,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1844337843, now seen corresponding path program 1 times [2018-01-29 22:46:08,739 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:08,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:08,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:08,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:08,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:08,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:08,793 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-29 22:46:08,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:08,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:46:08,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:46:08,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:46:08,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:46:08,794 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand 7 states. [2018-01-29 22:46:08,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:08,879 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-01-29 22:46:08,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:46:08,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-29 22:46:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:08,880 INFO L225 Difference]: With dead ends: 106 [2018-01-29 22:46:08,880 INFO L226 Difference]: Without dead ends: 104 [2018-01-29 22:46:08,880 INFO L553 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-29 22:46:08,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-29 22:46:08,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-29 22:46:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-29 22:46:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-01-29 22:46:08,884 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 39 [2018-01-29 22:46:08,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:08,884 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-01-29 22:46:08,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:46:08,885 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-01-29 22:46:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-29 22:46:08,885 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:08,885 INFO L350 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-29 22:46:08,886 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:08,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1321660321, now seen corresponding path program 1 times [2018-01-29 22:46:08,886 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:08,886 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:08,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:08,887 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:08,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:08,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:09,072 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-29 22:46:09,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:09,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 22:46:09,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:46:09,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:46:09,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:46:09,074 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 7 states. [2018-01-29 22:46:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:09,140 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2018-01-29 22:46:09,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:46:09,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-29 22:46:09,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:09,142 INFO L225 Difference]: With dead ends: 137 [2018-01-29 22:46:09,142 INFO L226 Difference]: Without dead ends: 104 [2018-01-29 22:46:09,143 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:46:09,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-29 22:46:09,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-29 22:46:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-29 22:46:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-01-29 22:46:09,150 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 41 [2018-01-29 22:46:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:09,150 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-01-29 22:46:09,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:46:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-01-29 22:46:09,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-29 22:46:09,151 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:09,151 INFO L350 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-29 22:46:09,151 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:09,152 INFO L82 PathProgramCache]: Analyzing trace with hash 12727972, now seen corresponding path program 1 times [2018-01-29 22:46:09,152 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:09,154 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:09,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:09,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:09,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:09,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:09,280 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-29 22:46:09,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:09,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:46:09,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 22:46:09,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 22:46:09,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:46:09,281 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 8 states. [2018-01-29 22:46:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:09,348 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2018-01-29 22:46:09,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 22:46:09,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-01-29 22:46:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:09,349 INFO L225 Difference]: With dead ends: 131 [2018-01-29 22:46:09,349 INFO L226 Difference]: Without dead ends: 103 [2018-01-29 22:46:09,350 INFO L553 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-29 22:46:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-29 22:46:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-01-29 22:46:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-29 22:46:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2018-01-29 22:46:09,355 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 42 [2018-01-29 22:46:09,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:09,356 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2018-01-29 22:46:09,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 22:46:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2018-01-29 22:46:09,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-29 22:46:09,356 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:09,357 INFO L350 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-29 22:46:09,357 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:09,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1280833471, now seen corresponding path program 1 times [2018-01-29 22:46:09,357 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:09,357 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:09,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:09,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:09,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:09,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:09,482 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-29 22:46:09,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:09,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:46:09,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:46:09,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:46:09,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:46:09,483 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 6 states. [2018-01-29 22:46:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:09,654 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-01-29 22:46:09,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:46:09,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-01-29 22:46:09,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:09,655 INFO L225 Difference]: With dead ends: 103 [2018-01-29 22:46:09,655 INFO L226 Difference]: Without dead ends: 90 [2018-01-29 22:46:09,656 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:46:09,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-29 22:46:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-01-29 22:46:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-29 22:46:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-01-29 22:46:09,662 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 44 [2018-01-29 22:46:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:09,662 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-01-29 22:46:09,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:46:09,663 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-01-29 22:46:09,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-29 22:46:09,663 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:09,664 INFO L350 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-29 22:46:09,664 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:09,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1275551011, now seen corresponding path program 1 times [2018-01-29 22:46:09,664 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:09,664 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:09,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:09,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:09,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:09,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:10,016 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-29 22:46:10,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:10,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-29 22:46:10,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 22:46:10,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 22:46:10,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-01-29 22:46:10,017 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 16 states. [2018-01-29 22:46:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:10,430 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-01-29 22:46:10,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-29 22:46:10,430 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-01-29 22:46:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:10,431 INFO L225 Difference]: With dead ends: 119 [2018-01-29 22:46:10,431 INFO L226 Difference]: Without dead ends: 118 [2018-01-29 22:46:10,431 INFO L553 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-29 22:46:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-29 22:46:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 105. [2018-01-29 22:46:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-29 22:46:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2018-01-29 22:46:10,438 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 46 [2018-01-29 22:46:10,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:10,438 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2018-01-29 22:46:10,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 22:46:10,438 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2018-01-29 22:46:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 22:46:10,439 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:10,439 INFO L350 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-29 22:46:10,440 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:10,440 INFO L82 PathProgramCache]: Analyzing trace with hash -850903064, now seen corresponding path program 1 times [2018-01-29 22:46:10,440 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:10,440 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:10,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:10,441 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:10,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:10,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:10,780 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-29 22:46:10,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:10,781 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-29 22:46:10,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:10,822 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:10,869 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-29 22:46:10,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:10,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:10,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:46:10,939 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:10,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:10,947 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-29 22:46:10,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:10,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:10,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-29 22:46:11,057 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-29 22:46:11,060 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-29 22:46:11,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:11,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:11,071 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-29 22:46:11,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-29 22:46:11,356 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-29 22:46:11,360 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-29 22:46:11,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:11,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:11,378 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-29 22:46:11,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-29 22:46:11,615 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-29 22:46:11,618 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-29 22:46:11,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:11,629 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-29 22:46:11,630 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:46:11,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:11,648 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-29 22:46:11,649 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-01-29 22:46:11,705 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-29 22:46:11,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:11,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2018-01-29 22:46:11,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 22:46:11,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 22:46:11,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2018-01-29 22:46:11,728 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 31 states. [2018-01-29 22:46:12,549 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 84 DAG size of output 63 [2018-01-29 22:46:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:13,835 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-01-29 22:46:13,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 22:46:13,836 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 47 [2018-01-29 22:46:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:13,837 INFO L225 Difference]: With dead ends: 116 [2018-01-29 22:46:13,837 INFO L226 Difference]: Without dead ends: 115 [2018-01-29 22:46:13,838 INFO L553 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-29 22:46:13,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-29 22:46:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-01-29 22:46:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-29 22:46:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-01-29 22:46:13,845 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 47 [2018-01-29 22:46:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:13,845 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-01-29 22:46:13,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 22:46:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-01-29 22:46:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 22:46:13,846 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:13,846 INFO L350 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-29 22:46:13,846 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:13,846 INFO L82 PathProgramCache]: Analyzing trace with hash 285211781, now seen corresponding path program 1 times [2018-01-29 22:46:13,847 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:13,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:13,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:13,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:13,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:13,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:13,954 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-29 22:46:13,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:13,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 22:46:13,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 22:46:13,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 22:46:13,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:46:13,956 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 8 states. [2018-01-29 22:46:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:14,095 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-01-29 22:46:14,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:46:14,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-01-29 22:46:14,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:14,096 INFO L225 Difference]: With dead ends: 112 [2018-01-29 22:46:14,096 INFO L226 Difference]: Without dead ends: 111 [2018-01-29 22:46:14,097 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-29 22:46:14,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-29 22:46:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2018-01-29 22:46:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-29 22:46:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-01-29 22:46:14,104 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 50 [2018-01-29 22:46:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:14,104 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-01-29 22:46:14,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 22:46:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-01-29 22:46:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 22:46:14,105 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:14,105 INFO L350 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-29 22:46:14,105 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:14,106 INFO L82 PathProgramCache]: Analyzing trace with hash 285211782, now seen corresponding path program 1 times [2018-01-29 22:46:14,106 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:14,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:14,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:14,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:14,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:14,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:14,449 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-29 22:46:14,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:46:14,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-29 22:46:14,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 22:46:14,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 22:46:14,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-01-29 22:46:14,450 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 17 states. [2018-01-29 22:46:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:14,790 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-01-29 22:46:14,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-29 22:46:14,791 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-01-29 22:46:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:14,791 INFO L225 Difference]: With dead ends: 123 [2018-01-29 22:46:14,791 INFO L226 Difference]: Without dead ends: 109 [2018-01-29 22:46:14,792 INFO L553 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-29 22:46:14,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-29 22:46:14,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2018-01-29 22:46:14,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-29 22:46:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-01-29 22:46:14,797 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 50 [2018-01-29 22:46:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:14,798 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-01-29 22:46:14,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 22:46:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-01-29 22:46:14,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-29 22:46:14,798 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:14,799 INFO L350 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-29 22:46:14,799 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:14,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1333931551, now seen corresponding path program 1 times [2018-01-29 22:46:14,799 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:14,799 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:14,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:14,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:14,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:14,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:15,023 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-29 22:46:15,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:15,023 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-29 22:46:15,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:15,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:15,060 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-29 22:46:15,062 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-29 22:46:15,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:15,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:15,070 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-29 22:46:15,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-29 22:46:15,266 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-29 22:46:15,272 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-29 22:46:15,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:46:15,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:15,284 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-29 22:46:15,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-29 22:46:15,339 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-29 22:46:15,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:15,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-01-29 22:46:15,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 22:46:15,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 22:46:15,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-01-29 22:46:15,361 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 21 states. [2018-01-29 22:46:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:16,095 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-01-29 22:46:16,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-29 22:46:16,128 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-01-29 22:46:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:16,129 INFO L225 Difference]: With dead ends: 126 [2018-01-29 22:46:16,129 INFO L226 Difference]: Without dead ends: 125 [2018-01-29 22:46:16,129 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2018-01-29 22:46:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-29 22:46:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2018-01-29 22:46:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-29 22:46:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-01-29 22:46:16,134 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 53 [2018-01-29 22:46:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:16,134 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-01-29 22:46:16,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 22:46:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-01-29 22:46:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 22:46:16,134 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:16,134 INFO L350 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-29 22:46:16,135 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:16,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1659002125, now seen corresponding path program 2 times [2018-01-29 22:46:16,135 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:16,135 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:16,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:16,136 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:16,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:16,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:16,982 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-29 22:46:16,982 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:16,982 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-29 22:46:16,987 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:46:17,007 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:46:17,015 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:46:17,018 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:46:17,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:17,025 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-29 22:46:17,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:17,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:17,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:46:17,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:46:17,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:17,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:17,039 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:17,039 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-29 22:46:17,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:17,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:17,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-29 22:46:17,082 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-29 22:46:17,084 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-29 22:46:17,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:17,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:17,089 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-29 22:46:17,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-29 22:46:17,277 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-29 22:46:17,279 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-29 22:46:17,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:17,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:17,290 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-29 22:46:17,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:30 [2018-01-29 22:46:17,581 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-29 22:46:17,583 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-29 22:46:17,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:17,592 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-29 22:46:17,593 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:46:17,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:17,604 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-29 22:46:17,604 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-01-29 22:46:17,668 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-29 22:46:17,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:17,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2018-01-29 22:46:17,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-29 22:46:17,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-29 22:46:17,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2018-01-29 22:46:17,689 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 36 states. [2018-01-29 22:46:18,989 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 108 DAG size of output 79 [2018-01-29 22:46:19,300 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 102 DAG size of output 73 [2018-01-29 22:46:19,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:19,963 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-01-29 22:46:19,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 22:46:19,963 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 54 [2018-01-29 22:46:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:19,964 INFO L225 Difference]: With dead ends: 117 [2018-01-29 22:46:19,964 INFO L226 Difference]: Without dead ends: 92 [2018-01-29 22:46:19,965 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=486, Invalid=2936, Unknown=0, NotChecked=0, Total=3422 [2018-01-29 22:46:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-29 22:46:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-01-29 22:46:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-29 22:46:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2018-01-29 22:46:19,971 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 54 [2018-01-29 22:46:19,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:19,971 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2018-01-29 22:46:19,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-29 22:46:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2018-01-29 22:46:19,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 22:46:19,972 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:19,972 INFO L350 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-29 22:46:19,973 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:19,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1597794849, now seen corresponding path program 1 times [2018-01-29 22:46:19,973 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:19,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:19,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:19,974 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:46:19,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:19,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:20,271 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-29 22:46:20,271 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:20,271 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-29 22:46:20,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:20,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:20,301 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-29 22:46:20,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:20,307 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-29 22:46:20,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:20,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:20,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:46:20,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:20,354 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-29 22:46:20,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:20,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:20,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:20,365 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-29 22:46:20,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:20,370 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-29 22:46:20,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:46:20,656 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-29 22:46:20,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:20,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-01-29 22:46:20,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-29 22:46:20,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-29 22:46:20,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=916, Unknown=0, NotChecked=0, Total=992 [2018-01-29 22:46:20,677 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand 32 states. [2018-01-29 22:46:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:21,614 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-01-29 22:46:21,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 22:46:21,650 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 54 [2018-01-29 22:46:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:21,651 INFO L225 Difference]: With dead ends: 105 [2018-01-29 22:46:21,651 INFO L226 Difference]: Without dead ends: 104 [2018-01-29 22:46:21,652 INFO L553 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-29 22:46:21,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-29 22:46:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2018-01-29 22:46:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-29 22:46:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-01-29 22:46:21,658 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 54 [2018-01-29 22:46:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:21,659 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-01-29 22:46:21,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-29 22:46:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-01-29 22:46:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-29 22:46:21,660 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:21,660 INFO L350 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-29 22:46:21,660 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:21,660 INFO L82 PathProgramCache]: Analyzing trace with hash -928928352, now seen corresponding path program 1 times [2018-01-29 22:46:21,660 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:21,660 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:21,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:21,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:21,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:21,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:21,967 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-29 22:46:21,967 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:21,967 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-29 22:46:21,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:21,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:22,004 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-29 22:46:22,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:46:22,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:22,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:22,015 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-29 22:46:22,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-29 22:46:22,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-29 22:46:22,200 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-29 22:46:22,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:46:22,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:22,213 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-29 22:46:22,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-29 22:46:22,259 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-29 22:46:22,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:22,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-01-29 22:46:22,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 22:46:22,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 22:46:22,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-01-29 22:46:22,281 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 21 states. [2018-01-29 22:46:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:22,871 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-01-29 22:46:22,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-29 22:46:22,871 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-01-29 22:46:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:22,872 INFO L225 Difference]: With dead ends: 100 [2018-01-29 22:46:22,872 INFO L226 Difference]: Without dead ends: 99 [2018-01-29 22:46:22,872 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2018-01-29 22:46:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-29 22:46:22,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-01-29 22:46:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-29 22:46:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2018-01-29 22:46:22,877 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 55 [2018-01-29 22:46:22,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:22,877 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2018-01-29 22:46:22,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 22:46:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-01-29 22:46:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-29 22:46:22,878 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:22,878 INFO L350 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-29 22:46:22,878 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:22,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1860121834, now seen corresponding path program 1 times [2018-01-29 22:46:22,878 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:22,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:22,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:22,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:22,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:22,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:23,403 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-29 22:46:23,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:23,403 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-29 22:46:23,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:23,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:23,523 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-29 22:46:23,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 22:46:23,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2018-01-29 22:46:23,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 22:46:23,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 22:46:23,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2018-01-29 22:46:23,554 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 22 states. [2018-01-29 22:46:25,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:25,046 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-01-29 22:46:25,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 22:46:25,046 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-01-29 22:46:25,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:25,047 INFO L225 Difference]: With dead ends: 136 [2018-01-29 22:46:25,047 INFO L226 Difference]: Without dead ends: 117 [2018-01-29 22:46:25,047 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=423, Invalid=2229, Unknown=0, NotChecked=0, Total=2652 [2018-01-29 22:46:25,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-29 22:46:25,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2018-01-29 22:46:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-29 22:46:25,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-29 22:46:25,054 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 61 [2018-01-29 22:46:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:25,055 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-29 22:46:25,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 22:46:25,055 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-29 22:46:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-29 22:46:25,055 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:25,056 INFO L350 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-29 22:46:25,056 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash 727486549, now seen corresponding path program 1 times [2018-01-29 22:46:25,056 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:25,056 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:25,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:25,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:25,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:25,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:25,751 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-29 22:46:25,751 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:25,751 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-29 22:46:25,756 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:25,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:25,783 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-29 22:46:25,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:25,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:25,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:46:25,789 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-29 22:46:25,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:25,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:25,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:25,796 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-29 22:46:25,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:25,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:25,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-29 22:46:25,831 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-29 22:46:25,832 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-29 22:46:25,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:25,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:25,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:25,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-29 22:46:26,132 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-29 22:46:26,133 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-29 22:46:26,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:26,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:26,142 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-29 22:46:26,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-01-29 22:46:26,184 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-29 22:46:26,185 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-29 22:46:26,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:26,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:26,193 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-29 22:46:26,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-29 22:46:26,323 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-29 22:46:26,329 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-29 22:46:26,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:46:26,337 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-29 22:46:26,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:26,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:26,349 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-29 22:46:26,350 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-01-29 22:46:26,427 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-29 22:46:26,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:26,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 40 [2018-01-29 22:46:26,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-29 22:46:26,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-29 22:46:26,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1538, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 22:46:26,450 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 41 states. [2018-01-29 22:46:28,333 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 80 DAG size of output 54 [2018-01-29 22:46:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:29,339 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-29 22:46:29,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-29 22:46:29,339 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 62 [2018-01-29 22:46:29,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:29,340 INFO L225 Difference]: With dead ends: 114 [2018-01-29 22:46:29,340 INFO L226 Difference]: Without dead ends: 95 [2018-01-29 22:46:29,341 INFO L553 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-29 22:46:29,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-29 22:46:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-29 22:46:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-29 22:46:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-01-29 22:46:29,346 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 62 [2018-01-29 22:46:29,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:29,346 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-01-29 22:46:29,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-29 22:46:29,346 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-01-29 22:46:29,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-29 22:46:29,347 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:29,347 INFO L350 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-29 22:46:29,347 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:29,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1474470770, now seen corresponding path program 2 times [2018-01-29 22:46:29,348 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:29,348 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:29,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:29,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:29,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:29,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:30,053 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-29 22:46:30,053 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:30,053 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-29 22:46:30,058 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:46:30,071 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:46:30,079 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:46:30,081 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:46:30,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:30,087 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-29 22:46:30,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:30,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:30,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:46:30,093 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:30,094 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:30,095 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-29 22:46:30,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:30,099 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-29 22:46:30,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:30,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:30,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-29 22:46:30,146 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-29 22:46:30,147 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-29 22:46:30,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:30,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:30,153 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-29 22:46:30,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-29 22:46:30,578 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-29 22:46:30,581 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-29 22:46:30,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:30,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:30,598 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-29 22:46:30,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-29 22:46:30,808 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-29 22:46:30,820 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-29 22:46:30,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:46:30,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:30,839 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-29 22:46:30,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-29 22:46:30,926 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-29 22:46:30,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:30,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2018-01-29 22:46:30,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-29 22:46:30,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-29 22:46:30,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1321, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 22:46:30,959 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 38 states. [2018-01-29 22:46:32,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:32,708 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2018-01-29 22:46:32,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 22:46:32,709 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 68 [2018-01-29 22:46:32,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:32,709 INFO L225 Difference]: With dead ends: 110 [2018-01-29 22:46:32,709 INFO L226 Difference]: Without dead ends: 109 [2018-01-29 22:46:32,710 INFO L553 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-29 22:46:32,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-29 22:46:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2018-01-29 22:46:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-29 22:46:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-01-29 22:46:32,718 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 68 [2018-01-29 22:46:32,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:32,719 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-01-29 22:46:32,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-29 22:46:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-01-29 22:46:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-29 22:46:32,719 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:32,720 INFO L350 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-29 22:46:32,720 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:32,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1536046356, now seen corresponding path program 2 times [2018-01-29 22:46:32,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:32,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:32,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:32,721 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:46:32,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:32,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:33,300 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-29 22:46:33,301 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:33,301 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-29 22:46:33,310 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:46:33,323 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:46:33,330 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:46:33,335 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:46:33,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:33,364 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-29 22:46:33,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:33,368 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-29 22:46:33,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:33,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:33,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:46:33,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:33,382 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-29 22:46:33,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:33,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:33,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:33,392 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-29 22:46:33,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:33,397 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-29 22:46:33,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:46:33,749 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-29 22:46:33,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:33,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 28 [2018-01-29 22:46:33,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 22:46:33,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 22:46:33,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2018-01-29 22:46:33,770 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 29 states. [2018-01-29 22:46:34,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:34,843 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2018-01-29 22:46:34,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 22:46:34,844 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 69 [2018-01-29 22:46:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:34,845 INFO L225 Difference]: With dead ends: 110 [2018-01-29 22:46:34,845 INFO L226 Difference]: Without dead ends: 109 [2018-01-29 22:46:34,846 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=270, Invalid=2082, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 22:46:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-29 22:46:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2018-01-29 22:46:34,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-29 22:46:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-01-29 22:46:34,853 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 69 [2018-01-29 22:46:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:34,853 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-01-29 22:46:34,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 22:46:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-01-29 22:46:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-29 22:46:34,854 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:34,854 INFO L350 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-29 22:46:34,854 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:34,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1451835661, now seen corresponding path program 2 times [2018-01-29 22:46:34,854 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:34,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:34,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:34,855 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:46:34,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:34,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:35,405 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-29 22:46:35,405 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:35,405 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-29 22:46:35,410 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:46:35,422 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:46:35,429 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:46:35,432 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:46:35,435 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:35,437 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-29 22:46:35,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:35,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:35,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:46:35,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:35,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:35,446 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-29 22:46:35,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:35,451 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-29 22:46:35,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:35,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:35,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-29 22:46:35,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:46:35,512 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-29 22:46:35,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:35,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:35,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:46:35,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-29 22:46:35,908 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-29 22:46:35,909 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-29 22:46:35,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:35,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:35,920 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-29 22:46:35,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-29 22:46:36,063 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-29 22:46:36,068 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-29 22:46:36,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:46:36,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:36,079 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-29 22:46:36,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-29 22:46:36,148 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-29 22:46:36,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:36,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2018-01-29 22:46:36,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-29 22:46:36,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-29 22:46:36,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1321, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 22:46:36,169 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 38 states. [2018-01-29 22:46:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:37,785 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-01-29 22:46:37,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 22:46:37,785 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 70 [2018-01-29 22:46:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:37,786 INFO L225 Difference]: With dead ends: 107 [2018-01-29 22:46:37,786 INFO L226 Difference]: Without dead ends: 98 [2018-01-29 22:46:37,787 INFO L553 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-29 22:46:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-29 22:46:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-29 22:46:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-29 22:46:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-01-29 22:46:37,795 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 70 [2018-01-29 22:46:37,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:37,795 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-01-29 22:46:37,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-29 22:46:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-01-29 22:46:37,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-29 22:46:37,796 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:37,796 INFO L350 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-29 22:46:37,796 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:37,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1104147357, now seen corresponding path program 1 times [2018-01-29 22:46:37,796 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:37,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:37,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:37,797 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:46:37,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:37,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:38,701 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-29 22:46:38,701 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:38,717 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-29 22:46:38,723 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:38,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:38,759 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-29 22:46:38,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:38,764 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-29 22:46:38,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:38,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:38,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:46:38,776 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:38,778 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-29 22:46:38,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:38,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:38,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:38,788 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-29 22:46:38,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:38,793 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-29 22:46:38,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:46:39,140 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-29 22:46:39,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:39,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 32 [2018-01-29 22:46:39,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-29 22:46:39,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-29 22:46:39,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 22:46:39,161 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 33 states. [2018-01-29 22:46:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:41,727 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2018-01-29 22:46:41,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-29 22:46:41,727 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 81 [2018-01-29 22:46:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:41,728 INFO L225 Difference]: With dead ends: 116 [2018-01-29 22:46:41,728 INFO L226 Difference]: Without dead ends: 115 [2018-01-29 22:46:41,729 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=627, Invalid=4923, Unknown=0, NotChecked=0, Total=5550 [2018-01-29 22:46:41,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-29 22:46:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2018-01-29 22:46:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-29 22:46:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-01-29 22:46:41,734 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 81 [2018-01-29 22:46:41,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:41,734 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-01-29 22:46:41,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-29 22:46:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-01-29 22:46:41,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-29 22:46:41,735 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:41,735 INFO L350 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-29 22:46:41,735 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:41,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1345617343, now seen corresponding path program 3 times [2018-01-29 22:46:41,735 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:41,735 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:41,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:41,736 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:46:41,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:41,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:42,240 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-29 22:46:42,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:42,240 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-29 22:46:42,246 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:46:42,258 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:46:42,263 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:46:42,270 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:46:42,274 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:46:42,277 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:46:42,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:42,282 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-29 22:46:42,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:42,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:42,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:46:42,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:42,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:42,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:46:42,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:42,300 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-29 22:46:42,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:42,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:42,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-29 22:46:42,345 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-29 22:46:42,348 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-29 22:46:42,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:42,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:42,357 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-29 22:46:42,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-29 22:46:42,482 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-29 22:46:42,484 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-29 22:46:42,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:42,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:42,490 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-29 22:46:42,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-29 22:46:42,508 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-29 22:46:42,509 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-29 22:46:42,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:42,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:42,516 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-29 22:46:42,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-01-29 22:46:42,561 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-29 22:46:42,566 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-29 22:46:42,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:46:42,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:42,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:42,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-29 22:46:42,652 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-29 22:46:42,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:42,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 31 [2018-01-29 22:46:42,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-29 22:46:42,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-29 22:46:42,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2018-01-29 22:46:42,673 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 32 states. [2018-01-29 22:46:43,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:43,579 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-01-29 22:46:43,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-29 22:46:43,579 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 83 [2018-01-29 22:46:43,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:43,579 INFO L225 Difference]: With dead ends: 97 [2018-01-29 22:46:43,579 INFO L226 Difference]: Without dead ends: 96 [2018-01-29 22:46:43,580 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=469, Invalid=2501, Unknown=0, NotChecked=0, Total=2970 [2018-01-29 22:46:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-29 22:46:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-29 22:46:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-29 22:46:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-01-29 22:46:43,585 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 83 [2018-01-29 22:46:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:43,585 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-01-29 22:46:43,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-29 22:46:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-01-29 22:46:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-29 22:46:43,586 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:43,586 INFO L350 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-29 22:46:43,586 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:43,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1235535297, now seen corresponding path program 3 times [2018-01-29 22:46:43,586 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:43,587 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:43,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:43,587 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:46:43,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:43,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:44,368 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-29 22:46:44,368 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:44,406 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-29 22:46:44,411 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:46:44,424 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:46:44,429 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:46:44,434 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:46:44,441 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:46:44,445 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:46:44,448 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:44,456 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-29 22:46:44,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:44,462 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-29 22:46:44,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:44,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:44,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:46:44,514 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:44,516 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-29 22:46:44,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:44,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:44,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:44,525 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-29 22:46:44,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:44,530 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-29 22:46:44,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:46:45,415 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-29 22:46:45,435 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:45,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29] total 49 [2018-01-29 22:46:45,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-01-29 22:46:45,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-01-29 22:46:45,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2314, Unknown=0, NotChecked=0, Total=2450 [2018-01-29 22:46:45,436 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 50 states. [2018-01-29 22:46:49,640 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 75 DAG size of output 61 [2018-01-29 22:46:49,836 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 68 DAG size of output 58 [2018-01-29 22:46:50,042 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 65 DAG size of output 55 [2018-01-29 22:46:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:50,802 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2018-01-29 22:46:50,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-29 22:46:50,803 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 84 [2018-01-29 22:46:50,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:50,803 INFO L225 Difference]: With dead ends: 120 [2018-01-29 22:46:50,804 INFO L226 Difference]: Without dead ends: 119 [2018-01-29 22:46:50,806 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2481 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1137, Invalid=9369, Unknown=0, NotChecked=0, Total=10506 [2018-01-29 22:46:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-29 22:46:50,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 88. [2018-01-29 22:46:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-29 22:46:50,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-01-29 22:46:50,814 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 84 [2018-01-29 22:46:50,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:50,814 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-01-29 22:46:50,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-01-29 22:46:50,814 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-01-29 22:46:50,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-29 22:46:50,815 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:50,815 INFO L350 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-29 22:46:50,815 INFO L371 AbstractCegarLoop]: === Iteration 33 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:46:50,815 INFO L82 PathProgramCache]: Analyzing trace with hash 725927424, now seen corresponding path program 3 times [2018-01-29 22:46:50,815 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:50,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:50,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:50,816 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:46:50,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:50,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:51,450 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-29 22:46:51,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:51,450 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-29 22:46:51,455 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:46:51,467 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:46:51,472 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:46:51,483 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:46:51,490 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:46:51,493 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:46:51,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:51,498 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-29 22:46:51,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:51,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:51,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:46:51,538 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-29 22:46:51,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:51,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:51,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:51,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:46:51,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:51,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:51,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-01-29 22:46:51,595 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-29 22:46:51,597 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-29 22:46:51,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:51,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:51,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:51,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-29 22:46:51,866 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-29 22:46:51,868 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-29 22:46:51,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:51,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:51,876 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-29 22:46:51,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-01-29 22:46:52,036 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-29 22:46:52,038 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-29 22:46:52,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:52,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:46:52,049 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-29 22:46:52,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-01-29 22:46:52,204 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-29 22:46:52,209 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-29 22:46:52,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:46:52,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:52,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:46:52,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-29 22:46:52,329 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-29 22:46:52,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:52,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 28] total 50 [2018-01-29 22:46:52,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-29 22:46:52,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-29 22:46:52,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2366, Unknown=0, NotChecked=0, Total=2550 [2018-01-29 22:46:52,350 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 51 states. [2018-01-29 22:46:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:54,200 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2018-01-29 22:46:54,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-29 22:46:54,200 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 85 [2018-01-29 22:46:54,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:54,201 INFO L225 Difference]: With dead ends: 116 [2018-01-29 22:46:54,201 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 22:46:54,202 INFO L553 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-29 22:46:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 22:46:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 22:46:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 22:46:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 22:46:54,202 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2018-01-29 22:46:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:54,202 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 22:46:54,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-29 22:46:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 22:46:54,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 22:46:54,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 22:46:54,446 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 288 DAG size of output 265 [2018-01-29 22:46:54,587 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 85 DAG size of output 64 [2018-01-29 22:46:54,757 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 121 DAG size of output 59 [2018-01-29 22:46:55,680 WARN L146 SmtUtils]: Spent 919ms on a formula simplification. DAG size of input: 306 DAG size of output 151 [2018-01-29 22:46:55,684 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr2RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,706 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-29 22:46:55,707 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 559) no Hoare annotation was computed. [2018-01-29 22:46:55,707 INFO L399 ceAbstractionStarter]: For program point L546(lines 546 551) no Hoare annotation was computed. [2018-01-29 22:46:55,707 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-29 22:46:55,707 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-29 22:46:55,707 INFO L399 ceAbstractionStarter]: For program point L548''''(line 548) no Hoare annotation was computed. [2018-01-29 22:46:55,707 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-29 22:46:55,707 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-29 22:46:55,707 INFO L399 ceAbstractionStarter]: For program point L547(lines 547 550) no Hoare annotation was computed. [2018-01-29 22:46:55,707 INFO L399 ceAbstractionStarter]: For program point L555'''(line 555) no Hoare annotation was computed. [2018-01-29 22:46:55,707 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr3RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,707 INFO L399 ceAbstractionStarter]: For program point L548''''''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:46:55,707 INFO L399 ceAbstractionStarter]: For program point cstrlcpyFINAL(lines 540 559) no Hoare annotation was computed. [2018-01-29 22:46:55,707 INFO L399 ceAbstractionStarter]: For program point L546'(lines 546 551) no Hoare annotation was computed. [2018-01-29 22:46:55,708 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr4RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,708 INFO L399 ceAbstractionStarter]: For program point L548'''''(line 548) no Hoare annotation was computed. [2018-01-29 22:46:55,708 INFO L399 ceAbstractionStarter]: For program point L548'''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:46:55,708 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr0RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,708 INFO L399 ceAbstractionStarter]: For program point L555'''''''(line 555) no Hoare annotation was computed. [2018-01-29 22:46:55,708 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr5RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,708 INFO L399 ceAbstractionStarter]: For program point L548''''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:46:55,708 INFO L399 ceAbstractionStarter]: For program point L555'''''''''(lines 555 556) no Hoare annotation was computed. [2018-01-29 22:46:55,708 INFO L399 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-29 22:46:55,708 INFO L399 ceAbstractionStarter]: For program point L548'''(line 548) no Hoare annotation was computed. [2018-01-29 22:46:55,708 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-29 22:46:55,709 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-29 22:46:55,709 INFO L399 ceAbstractionStarter]: For program point L547''(lines 547 550) no Hoare annotation was computed. [2018-01-29 22:46:55,709 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr7RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,709 INFO L399 ceAbstractionStarter]: For program point L555''''''''(line 555) no Hoare annotation was computed. [2018-01-29 22:46:55,709 INFO L399 ceAbstractionStarter]: For program point L548''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:46:55,709 INFO L399 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-29 22:46:55,709 INFO L399 ceAbstractionStarter]: For program point L548'''''''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:46:55,709 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-29 22:46:55,709 INFO L399 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed. [2018-01-29 22:46:55,709 INFO L399 ceAbstractionStarter]: For program point L548'''''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:46:55,709 INFO L399 ceAbstractionStarter]: For program point L553(lines 553 554) no Hoare annotation was computed. [2018-01-29 22:46:55,709 INFO L399 ceAbstractionStarter]: For program point L540'(lines 540 559) no Hoare annotation was computed. [2018-01-29 22:46:55,709 INFO L399 ceAbstractionStarter]: For program point L552(lines 552 557) no Hoare annotation was computed. [2018-01-29 22:46:55,709 INFO L399 ceAbstractionStarter]: For program point L555(lines 555 556) no Hoare annotation was computed. [2018-01-29 22:46:55,709 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-29 22:46:55,710 INFO L399 ceAbstractionStarter]: For program point cstrlcpyEXIT(lines 540 559) no Hoare annotation was computed. [2018-01-29 22:46:55,710 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr1RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,710 INFO L399 ceAbstractionStarter]: For program point L548''''''''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:46:55,710 INFO L399 ceAbstractionStarter]: For program point L555''''(line 555) no Hoare annotation was computed. [2018-01-29 22:46:55,710 INFO L399 ceAbstractionStarter]: For program point L555'''''(line 555) no Hoare annotation was computed. [2018-01-29 22:46:55,710 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr6RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,710 INFO L399 ceAbstractionStarter]: For program point L547'''''(line 547) no Hoare annotation was computed. [2018-01-29 22:46:55,710 INFO L399 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-29 22:46:55,710 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,710 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,710 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 575) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:46:55,710 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,711 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 575) the Hoare annotation is: true [2018-01-29 22:46:55,711 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,711 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 575) the Hoare annotation is: true [2018-01-29 22:46:55,711 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,711 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,711 INFO L399 ceAbstractionStarter]: For program point L571'(line 571) no Hoare annotation was computed. [2018-01-29 22:46:55,711 INFO L399 ceAbstractionStarter]: For program point L561'(line 561) no Hoare annotation was computed. [2018-01-29 22:46:55,711 INFO L399 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-01-29 22:46:55,711 INFO L399 ceAbstractionStarter]: For program point L563(lines 563 565) no Hoare annotation was computed. [2018-01-29 22:46:55,711 INFO L399 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-29 22:46:55,712 INFO L399 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-29 22:46:55,712 INFO L399 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-29 22:46:55,712 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,712 INFO L399 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-29 22:46:55,712 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,712 INFO L399 ceAbstractionStarter]: For program point L570''(line 570) no Hoare annotation was computed. [2018-01-29 22:46:55,712 INFO L399 ceAbstractionStarter]: For program point L566'(lines 566 568) no Hoare annotation was computed. [2018-01-29 22:46:55,712 INFO L399 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-01-29 22:46:55,712 INFO L399 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-01-29 22:46:55,713 INFO L399 ceAbstractionStarter]: For program point L570'(line 570) no Hoare annotation was computed. [2018-01-29 22:46:55,713 INFO L399 ceAbstractionStarter]: For program point L570'''(line 570) no Hoare annotation was computed. [2018-01-29 22:46:55,713 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-29 22:46:55,713 INFO L399 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-29 22:46:55,713 INFO L399 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-01-29 22:46:55,713 INFO L399 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2018-01-29 22:46:55,713 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-29 22:46:55,713 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 560 575) no Hoare annotation was computed. [2018-01-29 22:46:55,714 INFO L399 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 560 575) no Hoare annotation was computed. [2018-01-29 22:46:55,714 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 560 575) no Hoare annotation was computed. [2018-01-29 22:46:55,714 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 560 575) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:46:55,714 INFO L399 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-01-29 22:46:55,714 INFO L399 ceAbstractionStarter]: For program point L563''(lines 563 565) no Hoare annotation was computed. [2018-01-29 22:46:55,714 INFO L399 ceAbstractionStarter]: For program point L569''(line 569) no Hoare annotation was computed. [2018-01-29 22:46:55,714 INFO L399 ceAbstractionStarter]: For program point L569'(line 569) no Hoare annotation was computed. [2018-01-29 22:46:55,725 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,726 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,727 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,727 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,727 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,728 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,728 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,729 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,729 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,730 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-29 22:46:55,730 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,730 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-29 22:46:55,730 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,731 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-29 22:46:55,731 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,731 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,731 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,732 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,733 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,733 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,733 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,734 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,734 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,734 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,736 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,737 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,737 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,737 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,737 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,738 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,738 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,738 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,738 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,738 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,739 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,739 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,739 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,739 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,739 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,739 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,740 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,741 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,742 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,753 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,754 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,754 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,755 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,755 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,755 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,756 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,756 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,756 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,757 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-29 22:46:55,757 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,757 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-29 22:46:55,758 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,758 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-29 22:46:55,758 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,758 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,759 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,759 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,760 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,760 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,761 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,761 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,761 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,761 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,762 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,762 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,762 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,763 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,763 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,763 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,765 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,765 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,765 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,765 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,769 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,769 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,769 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:46:55 BoogieIcfgContainer [2018-01-29 22:46:55,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:46:55,773 INFO L168 Benchmark]: Toolchain (without parser) took 51030.37 ms. Allocated memory was 307.8 MB in the beginning and 720.9 MB in the end (delta: 413.1 MB). Free memory was 267.8 MB in the beginning and 506.1 MB in the end (delta: -238.3 MB). Peak memory consumption was 378.9 MB. Max. memory is 5.3 GB. [2018-01-29 22:46:55,774 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:46:55,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.40 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:46:55,774 INFO L168 Benchmark]: Boogie Preprocessor took 39.85 ms. Allocated memory is still 307.8 MB. Free memory was 256.8 MB in the beginning and 254.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:46:55,774 INFO L168 Benchmark]: RCFGBuilder took 307.36 ms. Allocated memory is still 307.8 MB. Free memory was 254.8 MB in the beginning and 232.2 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-01-29 22:46:55,775 INFO L168 Benchmark]: TraceAbstraction took 50452.86 ms. Allocated memory was 307.8 MB in the beginning and 720.9 MB in the end (delta: 413.1 MB). Free memory was 232.2 MB in the beginning and 506.1 MB in the end (delta: -273.9 MB). Peak memory consumption was 343.3 MB. Max. memory is 5.3 GB. [2018-01-29 22:46:55,777 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.25 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.40 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.85 ms. Allocated memory is still 307.8 MB. Free memory was 256.8 MB in the beginning and 254.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 307.36 ms. Allocated memory is still 307.8 MB. Free memory was 254.8 MB in the beginning and 232.2 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50452.86 ms. Allocated memory was 307.8 MB in the beginning and 720.9 MB in the end (delta: 413.1 MB). Free memory was 232.2 MB in the beginning and 506.1 MB in the end (delta: -273.9 MB). Peak memory consumption was 343.3 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-29 22:46:55,787 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,788 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,789 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,790 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,790 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,790 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-29 22:46:55,791 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,791 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-29 22:46:55,791 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,791 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-29 22:46:55,791 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,792 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,792 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,792 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,793 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,793 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,793 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,794 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,794 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,794 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,794 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,795 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,796 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,797 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,804 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,805 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,807 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,807 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-29 22:46:55,807 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,807 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-29 22:46:55,808 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,808 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-29 22:46:55,808 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,808 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,808 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,809 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-29 22:46:55,810 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,810 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,810 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,810 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,810 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:55,810 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:46:55,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,811 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,814 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,814 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,814 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,814 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,816 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,816 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,816 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:55,818 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:55,818 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.3s OverallTime, 33 OverallIterations, 4 TraceHistogramMax, 29.0s 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.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1778 GetRequests, 743 SyntacticMatches, 35 SemanticMatches, 1000 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10791 ImplicationChecksByTransitivity, 35.1s 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.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2881 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.7s 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-29_22-46-55-824.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-29_22-46-55-824.csv Received shutdown request...