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_cstpcpy-alloca_true-valid-memsafety_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-1cceb4a
[2018-01-29 22:43:20,662 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-01-29 22:43:20,663 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-29 22:43:20,675 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-29 22:43:20,676 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-29 22:43:20,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-29 22:43:20,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-29 22:43:20,679 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-29 22:43:20,681 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-29 22:43:20,682 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-29 22:43:20,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-29 22:43:20,683 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-29 22:43:20,683 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-29 22:43:20,685 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-29 22:43:20,685 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-29 22:43:20,688 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-29 22:43:20,690 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-29 22:43:20,692 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-29 22:43:20,693 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-29 22:43:20,694 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-29 22:43:20,696 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-29 22:43:20,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-29 22:43:20,696 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-29 22:43:20,697 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-29 22:43:20,698 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-29 22:43:20,699 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-29 22:43:20,700 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-29 22:43:20,700 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-29 22:43:20,700 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-29 22:43:20,701 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-29 22:43:20,701 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-01-29 22:43:20,701 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:43:20,711 INFO L110 SettingsManager]: Loading preferences was successful
[2018-01-29 22:43:20,711 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-29 22:43:20,712 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-29 22:43:20,712 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-01-29 22:43:20,712 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-29 22:43:20,712 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-29 22:43:20,713 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true
[2018-01-29 22:43:20,713 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-29 22:43:20,713 INFO L133 SettingsManager]: * sizeof long=4
[2018-01-29 22:43:20,714 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-01-29 22:43:20,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-01-29 22:43:20,714 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-01-29 22:43:20,714 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-01-29 22:43:20,714 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-01-29 22:43:20,715 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-01-29 22:43:20,715 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-01-29 22:43:20,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-29 22:43:20,715 INFO L133 SettingsManager]: * sizeof long double=12
[2018-01-29 22:43:20,715 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-29 22:43:20,716 INFO L133 SettingsManager]: * Size of a code block=SingleStatement
[2018-01-29 22:43:20,716 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-01-29 22:43:20,716 INFO L133 SettingsManager]: * Add additional assume for each assert=false
[2018-01-29 22:43:20,716 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-01-29 22:43:20,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-29 22:43:20,717 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-29 22:43:20,717 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-01-29 22:43:20,717 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-01-29 22:43:20,717 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-29 22:43:20,717 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-01-29 22:43:20,718 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-29 22:43:20,718 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-29 22:43:20,718 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-29 22:43:20,719 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-29 22:43:20,719 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR
[2018-01-29 22:43:20,751 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-29 22:43:20,763 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-29 22:43:20,767 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-29 22:43:20,769 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-01-29 22:43:20,769 INFO L276 PluginConnector]: CDTParser initialized
[2018-01-29 22:43:20,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i
[2018-01-29 22:43:20,912 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-29 22:43:20,919 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-29 22:43:20,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-29 22:43:20,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-29 22:43:20,926 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-29 22:43:20,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:43:20" (1/1) ...
[2018-01-29 22:43:20,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67990aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:20, skipping insertion in model container
[2018-01-29 22:43:20,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:43:20" (1/1) ...
[2018-01-29 22:43:20,948 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-29 22:43:20,986 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-29 22:43:21,092 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-29 22:43:21,107 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-29 22:43:21,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:21 WrapperNode
[2018-01-29 22:43:21,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-29 22:43:21,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-29 22:43:21,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-29 22:43:21,115 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-01-29 22:43:21,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:21" (1/1) ...
[2018-01-29 22:43:21,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:21" (1/1) ...
[2018-01-29 22:43:21,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:21" (1/1) ...
[2018-01-29 22:43:21,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:21" (1/1) ...
[2018-01-29 22:43:21,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:21" (1/1) ...
[2018-01-29 22:43:21,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:21" (1/1) ...
[2018-01-29 22:43:21,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:21" (1/1) ...
[2018-01-29 22:43:21,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-29 22:43:21,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-29 22:43:21,150 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-01-29 22:43:21,150 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-01-29 22:43:21,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:21" (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:43:21,194 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-29 22:43:21,194 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-29 22:43:21,194 INFO L136 BoogieDeclarations]: Found implementation of procedure cstpcpy
[2018-01-29 22:43:21,194 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-01-29 22:43:21,194 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-01-29 22:43:21,195 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-01-29 22:43:21,195 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-29 22:43:21,195 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-29 22:43:21,195 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-29 22:43:21,195 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-29 22:43:21,195 INFO L128 BoogieDeclarations]: Found specification of procedure cstpcpy
[2018-01-29 22:43:21,196 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-01-29 22:43:21,196 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-29 22:43:21,196 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-29 22:43:21,375 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-29 22:43:21,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:43:21 BoogieIcfgContainer
[2018-01-29 22:43:21,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-29 22:43:21,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-29 22:43:21,376 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-01-29 22:43:21,378 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-01-29 22:43:21,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:43:20" (1/3) ...
[2018-01-29 22:43:21,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65984cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:43:21, skipping insertion in model container
[2018-01-29 22:43:21,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:21" (2/3) ...
[2018-01-29 22:43:21,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65984cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:43:21, skipping insertion in model container
[2018-01-29 22:43:21,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:43:21" (3/3) ...
[2018-01-29 22:43:21,381 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i
[2018-01-29 22:43:21,387 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-29 22:43:21,393 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations.
[2018-01-29 22:43:21,438 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-01-29 22:43:21,438 INFO L323 AbstractCegarLoop]: Hoare is true
[2018-01-29 22:43:21,438 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-29 22:43:21,438 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-29 22:43:21,438 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-29 22:43:21,439 INFO L327 AbstractCegarLoop]: Difference is false
[2018-01-29 22:43:21,439 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-29 22:43:21,439 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-29 22:43:21,440 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-29 22:43:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states.
[2018-01-29 22:43:21,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-01-29 22:43:21,464 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:43:21,465 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:43:21,465 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]===
[2018-01-29 22:43:21,470 INFO L82 PathProgramCache]: Analyzing trace with hash 285740110, now seen corresponding path program 1 times
[2018-01-29 22:43:21,472 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:43:21,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:43:21,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:21,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:43:21,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:43:21,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:43:21,621 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:43:21,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:43:21,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-01-29 22:43:21,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-29 22:43:21,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-29 22:43:21,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-29 22:43:21,637 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states.
[2018-01-29 22:43:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:43:21,741 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions.
[2018-01-29 22:43:21,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-29 22:43:21,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17
[2018-01-29 22:43:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:43:21,817 INFO L225 Difference]: With dead ends: 73
[2018-01-29 22:43:21,817 INFO L226 Difference]: Without dead ends: 54
[2018-01-29 22:43:21,820 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:43:21,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2018-01-29 22:43:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54.
[2018-01-29 22:43:21,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2018-01-29 22:43:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions.
[2018-01-29 22:43:21,853 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 17
[2018-01-29 22:43:21,853 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:43:21,854 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions.
[2018-01-29 22:43:21,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-29 22:43:21,854 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions.
[2018-01-29 22:43:21,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-01-29 22:43:21,855 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:43:21,855 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:43:21,855 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]===
[2018-01-29 22:43:21,855 INFO L82 PathProgramCache]: Analyzing trace with hash -82842589, now seen corresponding path program 1 times
[2018-01-29 22:43:21,856 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:43:21,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:43:21,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:21,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:43:21,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:43:21,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:43:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:43:21,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:43:21,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 22:43:21,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 22:43:21,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 22:43:21,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 22:43:21,929 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 4 states.
[2018-01-29 22:43:21,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:43:21,999 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions.
[2018-01-29 22:43:21,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-29 22:43:21,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20
[2018-01-29 22:43:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:43:22,001 INFO L225 Difference]: With dead ends: 54
[2018-01-29 22:43:22,001 INFO L226 Difference]: Without dead ends: 53
[2018-01-29 22:43:22,002 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:43:22,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2018-01-29 22:43:22,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53.
[2018-01-29 22:43:22,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states.
[2018-01-29 22:43:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions.
[2018-01-29 22:43:22,008 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 20
[2018-01-29 22:43:22,008 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:43:22,008 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions.
[2018-01-29 22:43:22,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 22:43:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions.
[2018-01-29 22:43:22,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-01-29 22:43:22,009 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:43:22,009 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:43:22,009 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]===
[2018-01-29 22:43:22,009 INFO L82 PathProgramCache]: Analyzing trace with hash -82842588, now seen corresponding path program 1 times
[2018-01-29 22:43:22,010 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:43:22,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:43:22,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:22,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:43:22,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:43:22,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:43:22,136 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:43:22,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:43:22,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-29 22:43:22,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 22:43:22,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 22:43:22,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 22:43:22,137 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states.
[2018-01-29 22:43:22,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:43:22,213 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions.
[2018-01-29 22:43:22,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 22:43:22,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20
[2018-01-29 22:43:22,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:43:22,215 INFO L225 Difference]: With dead ends: 53
[2018-01-29 22:43:22,215 INFO L226 Difference]: Without dead ends: 52
[2018-01-29 22:43:22,216 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:43:22,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2018-01-29 22:43:22,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52.
[2018-01-29 22:43:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states.
[2018-01-29 22:43:22,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions.
[2018-01-29 22:43:22,223 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 20
[2018-01-29 22:43:22,223 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:43:22,223 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions.
[2018-01-29 22:43:22,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 22:43:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions.
[2018-01-29 22:43:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-01-29 22:43:22,224 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:43:22,224 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]
[2018-01-29 22:43:22,224 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]===
[2018-01-29 22:43:22,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1935542125, now seen corresponding path program 1 times
[2018-01-29 22:43:22,224 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:43:22,224 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:43:22,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:22,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:43:22,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:43:22,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:43:22,272 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:43:22,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:43:22,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-29 22:43:22,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 22:43:22,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 22:43:22,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-29 22:43:22,273 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 5 states.
[2018-01-29 22:43:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:43:22,333 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions.
[2018-01-29 22:43:22,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-29 22:43:22,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25
[2018-01-29 22:43:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:43:22,334 INFO L225 Difference]: With dead ends: 52
[2018-01-29 22:43:22,334 INFO L226 Difference]: Without dead ends: 51
[2018-01-29 22:43:22,335 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-01-29 22:43:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2018-01-29 22:43:22,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2018-01-29 22:43:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2018-01-29 22:43:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions.
[2018-01-29 22:43:22,341 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 25
[2018-01-29 22:43:22,342 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:43:22,342 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions.
[2018-01-29 22:43:22,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 22:43:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions.
[2018-01-29 22:43:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-01-29 22:43:22,343 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:43:22,343 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]
[2018-01-29 22:43:22,343 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]===
[2018-01-29 22:43:22,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1935542124, now seen corresponding path program 1 times
[2018-01-29 22:43:22,343 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:43:22,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:43:22,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:22,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:43:22,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:43:22,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:43:22,439 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:43:22,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:43:22,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-01-29 22:43:22,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-29 22:43:22,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-29 22:43:22,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2018-01-29 22:43:22,440 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 8 states.
[2018-01-29 22:43:22,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:43:22,562 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions.
[2018-01-29 22:43:22,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-01-29 22:43:22,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25
[2018-01-29 22:43:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:43:22,566 INFO L225 Difference]: With dead ends: 65
[2018-01-29 22:43:22,566 INFO L226 Difference]: Without dead ends: 64
[2018-01-29 22:43:22,567 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2018-01-29 22:43:22,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2018-01-29 22:43:22,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53.
[2018-01-29 22:43:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states.
[2018-01-29 22:43:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions.
[2018-01-29 22:43:22,573 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 25
[2018-01-29 22:43:22,573 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:43:22,573 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions.
[2018-01-29 22:43:22,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-29 22:43:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions.
[2018-01-29 22:43:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-01-29 22:43:22,574 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:43:22,574 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]
[2018-01-29 22:43:22,574 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]===
[2018-01-29 22:43:22,574 INFO L82 PathProgramCache]: Analyzing trace with hash 127736295, now seen corresponding path program 1 times
[2018-01-29 22:43:22,574 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:43:22,574 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:43:22,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:22,575 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:43:22,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:43:22,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:43:22,705 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:43:22,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:43:22,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-01-29 22:43:22,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-01-29 22:43:22,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-01-29 22:43:22,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2018-01-29 22:43:22,706 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 10 states.
[2018-01-29 22:43:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:43:22,870 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions.
[2018-01-29 22:43:22,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-01-29 22:43:22,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26
[2018-01-29 22:43:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:43:22,871 INFO L225 Difference]: With dead ends: 53
[2018-01-29 22:43:22,871 INFO L226 Difference]: Without dead ends: 52
[2018-01-29 22:43:22,871 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182
[2018-01-29 22:43:22,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2018-01-29 22:43:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52.
[2018-01-29 22:43:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states.
[2018-01-29 22:43:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions.
[2018-01-29 22:43:22,877 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 26
[2018-01-29 22:43:22,877 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:43:22,877 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions.
[2018-01-29 22:43:22,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-01-29 22:43:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions.
[2018-01-29 22:43:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-01-29 22:43:22,878 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:43:22,878 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]
[2018-01-29 22:43:22,878 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]===
[2018-01-29 22:43:22,882 INFO L82 PathProgramCache]: Analyzing trace with hash 127736296, now seen corresponding path program 1 times
[2018-01-29 22:43:22,883 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:43:22,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:43:22,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:22,884 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:43:22,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:43:22,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:43:22,976 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:43:22,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:43:22,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-01-29 22:43:22,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-29 22:43:22,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-29 22:43:22,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2018-01-29 22:43:22,977 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 8 states.
[2018-01-29 22:43:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:43:23,109 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions.
[2018-01-29 22:43:23,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-01-29 22:43:23,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26
[2018-01-29 22:43:23,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:43:23,110 INFO L225 Difference]: With dead ends: 65
[2018-01-29 22:43:23,110 INFO L226 Difference]: Without dead ends: 64
[2018-01-29 22:43:23,111 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2018-01-29 22:43:23,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2018-01-29 22:43:23,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53.
[2018-01-29 22:43:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states.
[2018-01-29 22:43:23,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions.
[2018-01-29 22:43:23,115 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 26
[2018-01-29 22:43:23,115 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:43:23,115 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions.
[2018-01-29 22:43:23,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-29 22:43:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions.
[2018-01-29 22:43:23,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2018-01-29 22:43:23,116 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:43:23,116 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:43:23,116 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]===
[2018-01-29 22:43:23,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1893175373, now seen corresponding path program 1 times
[2018-01-29 22:43:23,116 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:43:23,116 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:43:23,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:23,117 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:43:23,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:43:23,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:43:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:43:23,379 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:43:23,379 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:43:23,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:43:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:43:23,432 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:43:23,489 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:43:23,493 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:43:23,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:23,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:23,516 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:43:23,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21
[2018-01-29 22:43:23,643 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 18 treesize of output 14
[2018-01-29 22:43:23,655 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 14 treesize of output 11
[2018-01-29 22:43:23,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-01-29 22:43:23,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 22:43:23,673 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:43:23,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33
[2018-01-29 22:43:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:43:23,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:43:23,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15
[2018-01-29 22:43:23,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-01-29 22:43:23,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-01-29 22:43:23,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240
[2018-01-29 22:43:23,763 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 16 states.
[2018-01-29 22:43:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:43:24,164 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions.
[2018-01-29 22:43:24,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-01-29 22:43:24,201 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36
[2018-01-29 22:43:24,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:43:24,202 INFO L225 Difference]: With dead ends: 78
[2018-01-29 22:43:24,203 INFO L226 Difference]: Without dead ends: 77
[2018-01-29 22:43:24,203 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506
[2018-01-29 22:43:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2018-01-29 22:43:24,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63.
[2018-01-29 22:43:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states.
[2018-01-29 22:43:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions.
[2018-01-29 22:43:24,212 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 36
[2018-01-29 22:43:24,212 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:43:24,212 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions.
[2018-01-29 22:43:24,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-01-29 22:43:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions.
[2018-01-29 22:43:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2018-01-29 22:43:24,215 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:43:24,215 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:43:24,215 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]===
[2018-01-29 22:43:24,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1441105585, now seen corresponding path program 1 times
[2018-01-29 22:43:24,215 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:43:24,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:43:24,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:24,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:43:24,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:43:24,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:43:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:43:24,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:43:24,457 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:43:24,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:43:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:43:24,489 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:43:24,495 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:43:24,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:24,501 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:43:24,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:24,506 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:43:24,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14
[2018-01-29 22:43:24,541 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 22:43:24,542 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 22:43:24,544 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:43:24,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:24,552 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:43:24,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:24,557 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:43:24,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15
[2018-01-29 22:43:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:43:24,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:43:24,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25
[2018-01-29 22:43:24,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states
[2018-01-29 22:43:24,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2018-01-29 22:43:24,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650
[2018-01-29 22:43:24,832 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 26 states.
[2018-01-29 22:43:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:43:25,476 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions.
[2018-01-29 22:43:25,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-01-29 22:43:25,477 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37
[2018-01-29 22:43:25,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:43:25,478 INFO L225 Difference]: With dead ends: 80
[2018-01-29 22:43:25,478 INFO L226 Difference]: Without dead ends: 79
[2018-01-29 22:43:25,478 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406
[2018-01-29 22:43:25,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2018-01-29 22:43:25,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 64.
[2018-01-29 22:43:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states.
[2018-01-29 22:43:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions.
[2018-01-29 22:43:25,484 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 37
[2018-01-29 22:43:25,485 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:43:25,485 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions.
[2018-01-29 22:43:25,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states.
[2018-01-29 22:43:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions.
[2018-01-29 22:43:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2018-01-29 22:43:25,486 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:43:25,486 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:43:25,486 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]===
[2018-01-29 22:43:25,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1606546944, now seen corresponding path program 1 times
[2018-01-29 22:43:25,486 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:43:25,486 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:43:25,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:25,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:43:25,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:43:25,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:43:25,681 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:43:25,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:43:25,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-29 22:43:25,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-29 22:43:25,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-29 22:43:25,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-01-29 22:43:25,683 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 6 states.
[2018-01-29 22:43:25,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:43:25,801 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions.
[2018-01-29 22:43:25,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-01-29 22:43:25,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38
[2018-01-29 22:43:25,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:43:25,802 INFO L225 Difference]: With dead ends: 64
[2018-01-29 22:43:25,802 INFO L226 Difference]: Without dead ends: 52
[2018-01-29 22:43:25,803 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2018-01-29 22:43:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2018-01-29 22:43:25,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52.
[2018-01-29 22:43:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states.
[2018-01-29 22:43:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions.
[2018-01-29 22:43:25,808 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 38
[2018-01-29 22:43:25,808 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:43:25,809 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions.
[2018-01-29 22:43:25,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-29 22:43:25,809 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions.
[2018-01-29 22:43:25,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-01-29 22:43:25,810 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:43:25,810 INFO L350 BasicCegarLoop]: trace histogram [3, 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]
[2018-01-29 22:43:25,810 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]===
[2018-01-29 22:43:25,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1586619660, now seen corresponding path program 2 times
[2018-01-29 22:43:25,810 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:43:25,810 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:43:25,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:25,811 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:43:25,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:43:25,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:43:26,345 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:43:26,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:43:26,345 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:43:26,351 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-29 22:43:26,362 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 22:43:26,369 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 22:43:26,371 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 22:43:26,374 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:43:26,390 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:43:26,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:26,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:26,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-29 22:43:26,425 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 22:43:26,425 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 22:43:26,426 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:43:26,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:26,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:26,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11
[2018-01-29 22:43:26,467 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:43:26,468 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:43:26,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:26,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:26,476 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:43:26,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28
[2018-01-29 22:43:26,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30
[2018-01-29 22:43:26,684 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:43:26,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:26,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:26,719 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:43:26,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:42
[2018-01-29 22:43:26,980 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 41 treesize of output 35
[2018-01-29 22:43:26,983 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 9 treesize of output 1
[2018-01-29 22:43:26,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:26,995 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 22:43:27,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31
[2018-01-29 22:43:27,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts.
[2018-01-29 22:43:27,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 22:43:27,041 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:43:27,042 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:43
[2018-01-29 22:43:27,096 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:43:27,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:43:27,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30
[2018-01-29 22:43:27,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states
[2018-01-29 22:43:27,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2018-01-29 22:43:27,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930
[2018-01-29 22:43:27,117 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 31 states.
[2018-01-29 22:43:30,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:43:30,128 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions.
[2018-01-29 22:43:30,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-01-29 22:43:30,128 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 47
[2018-01-29 22:43:30,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:43:30,129 INFO L225 Difference]: With dead ends: 69
[2018-01-29 22:43:30,129 INFO L226 Difference]: Without dead ends: 68
[2018-01-29 22:43:30,130 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=278, Invalid=1978, Unknown=0, NotChecked=0, Total=2256
[2018-01-29 22:43:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2018-01-29 22:43:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62.
[2018-01-29 22:43:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states.
[2018-01-29 22:43:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions.
[2018-01-29 22:43:30,139 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 47
[2018-01-29 22:43:30,140 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:43:30,140 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions.
[2018-01-29 22:43:30,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states.
[2018-01-29 22:43:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions.
[2018-01-29 22:43:30,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-01-29 22:43:30,141 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:43:30,141 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 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]
[2018-01-29 22:43:30,141 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]===
[2018-01-29 22:43:30,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1940569208, now seen corresponding path program 2 times
[2018-01-29 22:43:30,142 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:43:30,142 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:43:30,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:30,143 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-29 22:43:30,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:43:30,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:43:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:43:30,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:43:30,426 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:43:30,431 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-29 22:43:30,441 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 22:43:30,446 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 22:43:30,448 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 22:43:30,451 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:43:30,455 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:43:30,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:30,463 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:43:30,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:30,470 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:43:30,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14
[2018-01-29 22:43:30,482 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 22:43:30,483 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 22:43:30,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-29 22:43:30,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:30,499 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:43:30,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:30,507 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:43:30,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18
[2018-01-29 22:43:30,778 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:43:30,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:43:30,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25
[2018-01-29 22:43:30,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states
[2018-01-29 22:43:30,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2018-01-29 22:43:30,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650
[2018-01-29 22:43:30,814 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 26 states.
[2018-01-29 22:43:31,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:43:31,595 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions.
[2018-01-29 22:43:31,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-01-29 22:43:31,595 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48
[2018-01-29 22:43:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:43:31,596 INFO L225 Difference]: With dead ends: 70
[2018-01-29 22:43:31,596 INFO L226 Difference]: Without dead ends: 69
[2018-01-29 22:43:31,596 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=1515, Unknown=0, NotChecked=0, Total=1722
[2018-01-29 22:43:31,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2018-01-29 22:43:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61.
[2018-01-29 22:43:31,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2018-01-29 22:43:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions.
[2018-01-29 22:43:31,604 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 48
[2018-01-29 22:43:31,604 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:43:31,604 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions.
[2018-01-29 22:43:31,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states.
[2018-01-29 22:43:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions.
[2018-01-29 22:43:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2018-01-29 22:43:31,605 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:43:31,605 INFO L350 BasicCegarLoop]: trace histogram [4, 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]
[2018-01-29 22:43:31,605 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]===
[2018-01-29 22:43:31,606 INFO L82 PathProgramCache]: Analyzing trace with hash 522203629, now seen corresponding path program 3 times
[2018-01-29 22:43:31,606 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:43:31,606 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:43:31,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:31,606 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-29 22:43:31,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:43:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:43:31,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:43:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-01-29 22:43:31,886 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:43:31,887 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:43:31,893 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-01-29 22:43:31,905 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-01-29 22:43:31,909 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-01-29 22:43:31,912 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-01-29 22:43:31,917 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-01-29 22:43:31,919 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 22:43:31,923 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:43:31,926 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:43:31,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:31,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:31,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-01-29 22:43:31,933 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:43:31,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:31,939 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 22:43:31,940 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 22:43:31,940 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:43:31,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:31,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:31,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13
[2018-01-29 22:43:31,963 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:43:31,965 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:43:31,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:31,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:31,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:31,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16
[2018-01-29 22:43:32,002 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:43:32,004 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:43:32,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:32,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:32,013 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:43:32,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16
[2018-01-29 22:43:32,038 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:43:32,045 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:43:32,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:32,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:43:32,053 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:43:32,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11
[2018-01-29 22:43:32,068 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:43:32,073 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:43:32,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-01-29 22:43:32,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 22:43:32,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 22:43:32,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34
[2018-01-29 22:43:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-01-29 22:43:32,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:43:32,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16
[2018-01-29 22:43:32,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-01-29 22:43:32,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-01-29 22:43:32,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272
[2018-01-29 22:43:32,139 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 17 states.
[2018-01-29 22:43:32,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:43:32,443 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions.
[2018-01-29 22:43:32,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-01-29 22:43:32,443 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58
[2018-01-29 22:43:32,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:43:32,444 INFO L225 Difference]: With dead ends: 61
[2018-01-29 22:43:32,444 INFO L226 Difference]: Without dead ends: 0
[2018-01-29 22:43:32,444 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 13 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756
[2018-01-29 22:43:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-01-29 22:43:32,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-01-29 22:43:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-01-29 22:43:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-01-29 22:43:32,445 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58
[2018-01-29 22:43:32,445 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:43:32,445 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-01-29 22:43:32,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-01-29 22:43:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-01-29 22:43:32,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2018-01-29 22:43:32,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2018-01-29 22:43:32,656 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 88 DAG size of output 45
[2018-01-29 22:43:33,263 WARN L146 SmtUtils]: Spent 501ms on a formula simplification. DAG size of input: 171 DAG size of output 104
[2018-01-29 22:43:33,269 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 560) no Hoare annotation was computed.
[2018-01-29 22:43:33,269 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed.
[2018-01-29 22:43:33,269 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|)
[2018-01-29 22:43:33,269 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed.
[2018-01-29 22:43:33,269 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true
[2018-01-29 22:43:33,270 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed.
[2018-01-29 22:43:33,270 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true
[2018-01-29 22:43:33,270 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed.
[2018-01-29 22:43:33,270 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 560) no Hoare annotation was computed.
[2018-01-29 22:43:33,270 INFO L399 ceAbstractionStarter]: For program point L551'(lines 551 553) no Hoare annotation was computed.
[2018-01-29 22:43:33,270 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed.
[2018-01-29 22:43:33,270 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 545 560) no Hoare annotation was computed.
[2018-01-29 22:43:33,270 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed.
[2018-01-29 22:43:33,270 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 560) no Hoare annotation was computed.
[2018-01-29 22:43:33,270 INFO L399 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed.
[2018-01-29 22:43:33,270 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed.
[2018-01-29 22:43:33,270 INFO L399 ceAbstractionStarter]: For program point L555'''(line 555) no Hoare annotation was computed.
[2018-01-29 22:43:33,270 INFO L399 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed.
[2018-01-29 22:43:33,270 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed.
[2018-01-29 22:43:33,270 INFO L399 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed.
[2018-01-29 22:43:33,271 INFO L399 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed.
[2018-01-29 22:43:33,271 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed.
[2018-01-29 22:43:33,271 INFO L399 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed.
[2018-01-29 22:43:33,271 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 545 560) no Hoare annotation was computed.
[2018-01-29 22:43:33,271 INFO L399 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed.
[2018-01-29 22:43:33,271 INFO L399 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed.
[2018-01-29 22:43:33,271 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed.
[2018-01-29 22:43:33,271 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed.
[2018-01-29 22:43:33,271 INFO L399 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed.
[2018-01-29 22:43:33,271 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 545 560) no Hoare annotation was computed.
[2018-01-29 22:43:33,271 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 545 560) the Hoare annotation is: (= |#valid| |old(#valid)|)
[2018-01-29 22:43:33,271 INFO L399 ceAbstractionStarter]: For program point L556'''(line 556) no Hoare annotation was computed.
[2018-01-29 22:43:33,271 INFO L399 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed.
[2018-01-29 22:43:33,272 INFO L395 ceAbstractionStarter]: At program point L557'(line 557) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString~4.base)) (.cse1 (select |#length| |main_#t~malloc7.base|))) (and (= 0 |main_#t~malloc6.offset|) (= 1 (select |#valid| |main_#t~malloc7.base|)) (<= main_~length2~4 main_~length1~4) (= (select |#valid| main_~nondetArea~4.base) 1) (<= 1 main_~length2~4) (<= main_~length2~4 (select |#length| |main_#t~malloc6.base|)) (not (= main_~nondetArea~4.base main_~nondetString~4.base)) (= 0 |main_#t~malloc7.offset|) (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|))) (= main_~nondetString~4.offset 0) (= 0 main_~nondetArea~4.offset) (= 1 (select |#valid| main_~nondetString~4.base)) (= 0 (select (select |#memory_int| main_~nondetString~4.base) (+ .cse0 (+ main_~nondetString~4.offset (- 1))))) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (= main_~length2~4 .cse0) (= main_~length2~4 .cse1) (<= .cse1 (select |#length| main_~nondetArea~4.base)) (not (= |main_#t~malloc7.base| main_~nondetArea~4.base)) (= (select |#valid| |main_#t~malloc6.base|) 1)))
[2018-01-29 22:43:33,272 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed.
[2018-01-29 22:43:33,272 INFO L399 ceAbstractionStarter]: For program point L548''(lines 548 550) no Hoare annotation was computed.
[2018-01-29 22:43:33,272 INFO L399 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed.
[2018-01-29 22:43:33,272 INFO L399 ceAbstractionStarter]: For program point cstpcpyErr2RequiresViolation(lines 1 560) no Hoare annotation was computed.
[2018-01-29 22:43:33,272 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed.
[2018-01-29 22:43:33,272 INFO L399 ceAbstractionStarter]: For program point L542'''''''''''''(line 542) no Hoare annotation was computed.
[2018-01-29 22:43:33,272 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 544) no Hoare annotation was computed.
[2018-01-29 22:43:33,272 INFO L399 ceAbstractionStarter]: For program point cstpcpyErr1RequiresViolation(lines 1 560) no Hoare annotation was computed.
[2018-01-29 22:43:33,272 INFO L399 ceAbstractionStarter]: For program point L542'''''''(line 542) no Hoare annotation was computed.
[2018-01-29 22:43:33,272 INFO L399 ceAbstractionStarter]: For program point L542'''''(line 542) no Hoare annotation was computed.
[2018-01-29 22:43:33,272 INFO L399 ceAbstractionStarter]: For program point L542''''''''(line 542) no Hoare annotation was computed.
[2018-01-29 22:43:33,272 INFO L399 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed.
[2018-01-29 22:43:33,272 INFO L399 ceAbstractionStarter]: For program point cstpcpyErr0RequiresViolation(lines 1 560) no Hoare annotation was computed.
[2018-01-29 22:43:33,273 INFO L399 ceAbstractionStarter]: For program point L542'''''''''(line 542) no Hoare annotation was computed.
[2018-01-29 22:43:33,273 INFO L395 ceAbstractionStarter]: At program point L542''''''''''''(line 542) the Hoare annotation is: (let ((.cse9 (select |#length| |cstpcpy_#in~from.base|))) (let ((.cse5 (select |#length| cstpcpy_~to.base)) (.cse8 (+ .cse9 (- 1))) (.cse12 (select |#memory_int| cstpcpy_~from.base)) (.cse4 (select |#length| cstpcpy_~from.base))) (let ((.cse2 (= 1 (select |#valid| cstpcpy_~to.base))) (.cse3 (= 1 (select |#valid| cstpcpy_~from.base))) (.cse6 (= 0 (select .cse12 (+ .cse4 (- 1))))) (.cse7 (not (= cstpcpy_~to.base |cstpcpy_#in~from.base|))) (.cse0 (<= 1 cstpcpy_~from.offset)) (.cse1 (= 0 (select (select |#memory_int| |cstpcpy_#in~from.base|) .cse8))) (.cse10 (not (= cstpcpy_~from.base cstpcpy_~to.base))) (.cse11 (<= .cse4 .cse5))) (or (and .cse0 .cse1 .cse2 (<= 2 cstpcpy_~to.offset) .cse3 (not (= cstpcpy_~to.base cstpcpy_~from.base)) (<= (+ cstpcpy_~from.offset 1) .cse4) (<= (+ .cse4 cstpcpy_~to.offset) (+ .cse5 cstpcpy_~from.offset)) .cse6 .cse7) (not (= 0 |cstpcpy_#in~from.offset|)) (not (= 1 (select |#valid| |cstpcpy_#in~from.base|))) (not (= 0 (select (select |old(#memory_int)| |cstpcpy_#in~from.base|) .cse8))) (and .cse2 .cse3 .cse6 .cse7 (= cstpcpy_~from.offset 0) .cse1 (= cstpcpy_~to.offset 0) (<= .cse9 .cse5) .cse10 (<= 1 .cse4) .cse11) (not (= (select |#valid| |cstpcpy_#in~to.base|) 1)) (not (= |cstpcpy_#in~to.offset| 0)) (not (exists ((main_~length2~4 Int)) (and (= (select (select |old(#memory_int)| |cstpcpy_#in~from.base|) (+ main_~length2~4 |cstpcpy_#in~from.offset| (- 1))) 0) (<= 1 main_~length2~4) (<= (+ main_~length2~4 |cstpcpy_#in~from.offset|) (select |#length| |cstpcpy_#in~from.base|))))) (and .cse2 (exists ((cstpcpy_~to.base Int) (cstpcpy_~to.offset Int)) (and (= (select (select |#memory_int| cstpcpy_~from.base) (+ cstpcpy_~from.offset (- 1))) (select (select |#memory_int| cstpcpy_~to.base) cstpcpy_~to.offset)) (not (= cstpcpy_~from.base cstpcpy_~to.base)))) .cse3 (or (= 1 cstpcpy_~from.offset) (<= (+ cstpcpy_~from.offset 2) .cse4)) .cse6 (not (= (select .cse12 (+ cstpcpy_~from.offset (- 1))) 0)) .cse7 .cse0 (exists ((main_~length2~4 Int)) (and (<= (+ main_~length2~4 cstpcpy_~from.offset) (+ (select |#length| cstpcpy_~from.base) 1)) (<= 1 main_~length2~4) (= 0 (select (select |#memory_int| cstpcpy_~from.base) (+ main_~length2~4 cstpcpy_~from.offset (- 2)))))) .cse1 .cse10 .cse11 (= 1 cstpcpy_~to.offset)) (= |cstpcpy_#in~from.base| |cstpcpy_#in~to.base|) (< (select |#length| |cstpcpy_#in~to.base|) .cse9)))))
[2018-01-29 22:43:33,273 INFO L395 ceAbstractionStarter]: At program point cstpcpyENTRY(lines 540 544) the Hoare annotation is: (let ((.cse1 (select |#length| |cstpcpy_#in~from.base|))) (let ((.cse0 (+ .cse1 (- 1)))) (or (not (= 0 |cstpcpy_#in~from.offset|)) (not (= 1 (select |#valid| |cstpcpy_#in~from.base|))) (not (= 0 (select (select |old(#memory_int)| |cstpcpy_#in~from.base|) .cse0))) (not (= (select |#valid| |cstpcpy_#in~to.base|) 1)) (not (= |cstpcpy_#in~to.offset| 0)) (not (exists ((main_~length2~4 Int)) (and (= (select (select |old(#memory_int)| |cstpcpy_#in~from.base|) (+ main_~length2~4 |cstpcpy_#in~from.offset| (- 1))) 0) (<= 1 main_~length2~4) (<= (+ main_~length2~4 |cstpcpy_#in~from.offset|) (select |#length| |cstpcpy_#in~from.base|))))) (= |cstpcpy_#in~from.base| |cstpcpy_#in~to.base|) (< (select |#length| |cstpcpy_#in~to.base|) .cse1) (= 0 (select (select |#memory_int| |cstpcpy_#in~from.base|) .cse0)))))
[2018-01-29 22:43:33,273 INFO L399 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed.
[2018-01-29 22:43:33,273 INFO L399 ceAbstractionStarter]: For program point cstpcpyErr3RequiresViolation(lines 1 560) no Hoare annotation was computed.
[2018-01-29 22:43:33,273 INFO L399 ceAbstractionStarter]: For program point L542''''''(line 542) no Hoare annotation was computed.
[2018-01-29 22:43:33,273 INFO L399 ceAbstractionStarter]: For program point L542'''''''''''(line 542) no Hoare annotation was computed.
[2018-01-29 22:43:33,273 INFO L399 ceAbstractionStarter]: For program point cstpcpyEXIT(lines 540 544) no Hoare annotation was computed.
[2018-01-29 22:43:33,273 INFO L399 ceAbstractionStarter]: For program point cstpcpyFINAL(lines 540 544) no Hoare annotation was computed.
[2018-01-29 22:43:33,273 INFO L399 ceAbstractionStarter]: For program point L542''''''''''(line 542) no Hoare annotation was computed.
[2018-01-29 22:43:33,274 INFO L399 ceAbstractionStarter]: For program point L542'''(line 542) no Hoare annotation was computed.
[2018-01-29 22:43:33,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED]
[2018-01-29 22:43:33,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.offset,QUANTIFIED]
[2018-01-29 22:43:33,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED]
[2018-01-29 22:43:33,285 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,286 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,287 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,288 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,289 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,290 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,291 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,292 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,293 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED]
[2018-01-29 22:43:33,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.offset,QUANTIFIED]
[2018-01-29 22:43:33,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED]
[2018-01-29 22:43:33,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,307 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,307 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,307 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,308 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,308 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,308 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,308 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,309 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,313 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,313 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,313 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,313 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,313 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,313 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,313 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,314 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,314 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:43:33 BoogieIcfgContainer
[2018-01-29 22:43:33,316 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-01-29 22:43:33,317 INFO L168 Benchmark]: Toolchain (without parser) took 12404.66 ms. Allocated memory was 307.8 MB in the beginning and 581.4 MB in the end (delta: 273.7 MB). Free memory was 267.8 MB in the beginning and 345.8 MB in the end (delta: -78.0 MB). Peak memory consumption was 195.7 MB. Max. memory is 5.3 GB.
[2018-01-29 22:43:33,318 INFO L168 Benchmark]: CDTParser took 0.16 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:43:33,319 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.23 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB.
[2018-01-29 22:43:33,319 INFO L168 Benchmark]: Boogie Preprocessor took 35.29 ms. Allocated memory is still 307.8 MB. Free memory was 256.5 MB in the beginning and 255.5 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB.
[2018-01-29 22:43:33,319 INFO L168 Benchmark]: RCFGBuilder took 225.77 ms. Allocated memory is still 307.8 MB. Free memory was 255.5 MB in the beginning and 237.5 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB.
[2018-01-29 22:43:33,320 INFO L168 Benchmark]: TraceAbstraction took 11940.05 ms. Allocated memory was 307.8 MB in the beginning and 581.4 MB in the end (delta: 273.7 MB). Free memory was 236.5 MB in the beginning and 345.8 MB in the end (delta: -109.2 MB). Peak memory consumption was 164.5 MB. Max. memory is 5.3 GB.
[2018-01-29 22:43:33,321 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.16 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 194.23 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 35.29 ms. Allocated memory is still 307.8 MB. Free memory was 256.5 MB in the beginning and 255.5 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB.
* RCFGBuilder took 225.77 ms. Allocated memory is still 307.8 MB. Free memory was 255.5 MB in the beginning and 237.5 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 11940.05 ms. Allocated memory was 307.8 MB in the beginning and 581.4 MB in the end (delta: 273.7 MB). Free memory was 236.5 MB in the beginning and 345.8 MB in the end (delta: -109.2 MB). Peak memory consumption was 164.5 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_~length2~4,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.offset,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.offset,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
- GenericResult: Unfinished Backtranslation
Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- 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 #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 #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 #memory_int
- 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 #memory_int
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #memory_int
- 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 #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 #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 #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 #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 #memory_int
- GenericResult: Unfinished Backtranslation
unknown boogie variable #length
- GenericResult: Unfinished Backtranslation
unknown boogie variable #memory_int
- 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
* 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: 545]: all allocated memory was freed
For all program executions holds that all allocated memory was freed at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- AllSpecificationsHoldResult: All specifications hold
7 specifications checked. All of them hold
- InvariantResult [Line: 542]: Loop Invariant
[2018-01-29 22:43:33,330 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,330 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,331 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,331 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED]
[2018-01-29 22:43:33,331 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.offset,QUANTIFIED]
[2018-01-29 22:43:33,331 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED]
[2018-01-29 22:43:33,332 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,332 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,332 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,333 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,333 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,333 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,336 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,336 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,336 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,336 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,336 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,337 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,337 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,337 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,338 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,338 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,338 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,338 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,338 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,339 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,339 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,339 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,339 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,339 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,340 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,340 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,340 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,344 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,345 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,345 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,345 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED]
[2018-01-29 22:43:33,345 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.offset,QUANTIFIED]
[2018-01-29 22:43:33,346 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstpcpy_~to.base,QUANTIFIED]
[2018-01-29 22:43:33,346 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,346 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,347 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED]
[2018-01-29 22:43:33,347 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,347 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,348 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,348 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,348 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,348 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,348 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,349 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,349 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,349 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,349 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,349 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,350 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,350 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,350 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,350 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int
[2018-01-29 22:43:33,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
[2018-01-29 22:43:33,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length
Derived loop invariant: ((((((((((((((((((1 <= from && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1]) && 1 == \valid[to]) && 2 <= to) && 1 == \valid[from]) && !(to == from)) && from + 1 <= unknown-#length-unknown[from]) && unknown-#length-unknown[from] + to <= unknown-#length-unknown[to] + from) && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1]) && !(to == from)) || !(0 == from)) || !(1 == \valid[from])) || !(0 == \old(unknown-#memory_int-unknown)[from][unknown-#length-unknown[from] + -1])) || ((((((((((1 == \valid[to] && 1 == \valid[from]) && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1]) && !(to == from)) && from == 0) && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1]) && to == 0) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && !(from == to)) && 1 <= unknown-#length-unknown[from]) && unknown-#length-unknown[from] <= unknown-#length-unknown[to])) || !(\valid[to] == 1)) || !(to == 0)) || !(\exists main_~length2~4 : int :: (\old(unknown-#memory_int-unknown)[from][main_~length2~4 + from + -1] == 0 && 1 <= main_~length2~4) && main_~length2~4 + from <= unknown-#length-unknown[from])) || ((((((((((((1 == \valid[to] && (\exists cstpcpy_~to.base : int, cstpcpy_~to.offset : int :: unknown-#memory_int-unknown[from][from + -1] == unknown-#memory_int-unknown[cstpcpy_~to.base][cstpcpy_~to.offset] && !(from == cstpcpy_~to.base))) && 1 == \valid[from]) && (1 == from || from + 2 <= unknown-#length-unknown[from])) && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1]) && !(unknown-#memory_int-unknown[from][from + -1] == 0)) && !(to == from)) && 1 <= from) && (\exists main_~length2~4 : int :: (main_~length2~4 + from <= unknown-#length-unknown[from] + 1 && 1 <= main_~length2~4) && 0 == unknown-#memory_int-unknown[from][main_~length2~4 + from + -2])) && 0 == unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + -1]) && !(from == to)) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && 1 == to)) || from == to) || unknown-#length-unknown[to] < unknown-#length-unknown[from]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 58 locations, 7 error locations. SAFE Result, 11.8s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 532 SDtfs, 956 SDslu, 3186 SDs, 0 SdLazy, 2381 SolverSat, 204 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 415 GetRequests, 183 SyntacticMatches, 15 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 502 HoareAnnotationTreeSize, 7 FomulaSimplifications, 28 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 880 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 649 NumberOfCodeBlocks, 649 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 631 ConstructedInterpolants, 23 QuantifiedInterpolants, 257026 SizeOfPredicates, 56 NumberOfNonLiveVariables, 735 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 13/152 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_cstpcpy-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-43-33-359.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-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-43-33-359.csv
Received shutdown request...