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_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:27:06,266 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:27:06,268 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:27:06,282 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:27:06,283 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:27:06,284 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:27:06,285 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:27:06,286 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:27:06,289 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:27:06,290 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:27:06,291 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:27:06,291 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:27:06,292 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:27:06,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:27:06,293 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:27:06,296 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:27:06,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:27:06,300 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:27:06,301 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:27:06,303 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:27:06,305 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:27:06,305 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:27:06,306 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:27:06,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:27:06,307 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:27:06,309 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:27:06,309 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:27:06,310 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:27:06,310 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:27:06,310 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:27:06,311 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:27:06,311 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:27:06,321 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:27:06,321 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:27:06,322 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:27:06,322 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:27:06,323 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:27:06,323 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:27:06,323 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:27:06,323 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:27:06,324 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:27:06,324 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:27:06,324 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:27:06,324 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:27:06,325 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:27:06,325 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:27:06,325 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:27:06,325 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:27:06,325 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:27:06,326 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:27:06,326 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:27:06,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:27:06,326 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:27:06,326 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:27:06,327 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:27:06,327 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:27:06,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:27:06,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:27:06,327 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:27:06,328 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:27:06,328 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:27:06,328 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:27:06,328 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:27:06,328 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:27:06,328 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:27:06,329 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:27:06,329 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:27:06,330 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:27:06,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:27:06,379 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:27:06,383 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:27:06,385 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:27:06,385 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:27:06,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:27:06,582 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:27:06,589 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:27:06,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:27:06,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:27:06,598 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:27:06,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:27:06" (1/1) ... [2018-01-25 05:27:06,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5054e5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:06, skipping insertion in model container [2018-01-25 05:27:06,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:27:06" (1/1) ... [2018-01-25 05:27:06,620 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:27:06,662 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:27:06,800 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:27:06,815 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:27:06,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:06 WrapperNode [2018-01-25 05:27:06,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:27:06,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:27:06,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:27:06,824 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:27:06,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:06" (1/1) ... [2018-01-25 05:27:06,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:06" (1/1) ... [2018-01-25 05:27:06,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:06" (1/1) ... [2018-01-25 05:27:06,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:06" (1/1) ... [2018-01-25 05:27:06,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:06" (1/1) ... [2018-01-25 05:27:06,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:06" (1/1) ... [2018-01-25 05:27:06,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:06" (1/1) ... [2018-01-25 05:27:06,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:27:06,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:27:06,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:27:06,862 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:27:06,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:06" (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-25 05:27:06,913 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:27:06,913 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:27:06,913 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-25 05:27:06,913 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:27:06,913 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:27:06,913 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:27:06,913 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:27:06,914 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:27:06,914 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:27:06,914 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:27:06,914 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-25 05:27:06,914 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:27:06,914 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:27:06,914 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:27:07,149 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:27:07,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:27:07 BoogieIcfgContainer [2018-01-25 05:27:07,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:27:07,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:27:07,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:27:07,154 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:27:07,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:27:06" (1/3) ... [2018-01-25 05:27:07,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d574751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:27:07, skipping insertion in model container [2018-01-25 05:27:07,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:27:06" (2/3) ... [2018-01-25 05:27:07,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d574751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:27:07, skipping insertion in model container [2018-01-25 05:27:07,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:27:07" (3/3) ... [2018-01-25 05:27:07,157 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:27:07,164 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:27:07,170 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 05:27:07,212 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:27:07,212 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:27:07,212 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:27:07,212 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:27:07,213 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:27:07,213 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:27:07,213 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:27:07,213 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:27:07,213 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:27:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-01-25 05:27:07,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:27:07,235 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:07,235 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:07,236 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:07,239 INFO L82 PathProgramCache]: Analyzing trace with hash 955833556, now seen corresponding path program 1 times [2018-01-25 05:27:07,241 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:07,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:07,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:07,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:07,283 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:07,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:07,509 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-25 05:27:07,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:07,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:27:07,511 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:07,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:27:07,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:27:07,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:27:07,526 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-01-25 05:27:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:07,752 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-01-25 05:27:07,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:27:07,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 05:27:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:07,761 INFO L225 Difference]: With dead ends: 73 [2018-01-25 05:27:07,762 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 05:27:07,764 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:27:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 05:27:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 05:27:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 05:27:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-25 05:27:07,793 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 13 [2018-01-25 05:27:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:07,794 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-25 05:27:07,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:27:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-25 05:27:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:27:07,794 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:07,795 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:07,795 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:07,795 INFO L82 PathProgramCache]: Analyzing trace with hash 955833557, now seen corresponding path program 1 times [2018-01-25 05:27:07,795 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:07,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:07,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:07,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:07,796 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:07,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:07,990 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-25 05:27:07,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:07,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:27:07,991 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:07,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:27:07,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:27:07,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:27:07,993 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-01-25 05:27:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:08,088 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-01-25 05:27:08,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:27:08,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 05:27:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:08,090 INFO L225 Difference]: With dead ends: 49 [2018-01-25 05:27:08,090 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 05:27:08,091 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:27:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 05:27:08,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 05:27:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 05:27:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-01-25 05:27:08,099 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 13 [2018-01-25 05:27:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:08,099 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-01-25 05:27:08,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:27:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-01-25 05:27:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:27:08,100 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:08,100 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:08,100 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:08,100 INFO L82 PathProgramCache]: Analyzing trace with hash -433930803, now seen corresponding path program 1 times [2018-01-25 05:27:08,101 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:08,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:08,102 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:08,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:08,102 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:08,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:08,208 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-25 05:27:08,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:08,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:27:08,209 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:08,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:27:08,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:27:08,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:27:08,210 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 5 states. [2018-01-25 05:27:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:08,268 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-01-25 05:27:08,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:27:08,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:27:08,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:08,269 INFO L225 Difference]: With dead ends: 48 [2018-01-25 05:27:08,269 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 05:27:08,270 INFO L525 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-25 05:27:08,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 05:27:08,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-25 05:27:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 05:27:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-25 05:27:08,274 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 14 [2018-01-25 05:27:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:08,274 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-25 05:27:08,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:27:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-25 05:27:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:27:08,275 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:08,275 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:08,275 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:08,275 INFO L82 PathProgramCache]: Analyzing trace with hash -433930804, now seen corresponding path program 1 times [2018-01-25 05:27:08,275 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:08,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:08,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:08,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:08,276 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:08,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:08,308 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-25 05:27:08,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:08,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:27:08,308 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:08,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:27:08,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:27:08,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:27:08,309 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2018-01-25 05:27:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:08,374 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-25 05:27:08,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:27:08,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:27:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:08,375 INFO L225 Difference]: With dead ends: 47 [2018-01-25 05:27:08,375 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 05:27:08,375 INFO L525 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-25 05:27:08,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 05:27:08,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 05:27:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 05:27:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-25 05:27:08,382 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 14 [2018-01-25 05:27:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:08,382 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-25 05:27:08,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:27:08,383 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-25 05:27:08,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:27:08,383 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:08,384 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:08,384 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:08,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2009852195, now seen corresponding path program 1 times [2018-01-25 05:27:08,384 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:08,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:08,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:08,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:08,386 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:08,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:08,451 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-25 05:27:08,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:08,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:27:08,452 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:08,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:27:08,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:27:08,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:27:08,453 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-01-25 05:27:08,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:08,526 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-01-25 05:27:08,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:27:08,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 05:27:08,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:08,527 INFO L225 Difference]: With dead ends: 46 [2018-01-25 05:27:08,527 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 05:27:08,528 INFO L525 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-25 05:27:08,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 05:27:08,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-25 05:27:08,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 05:27:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-01-25 05:27:08,532 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 18 [2018-01-25 05:27:08,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:08,532 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-01-25 05:27:08,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:27:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-01-25 05:27:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:27:08,533 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:08,533 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:08,533 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:08,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2009852196, now seen corresponding path program 1 times [2018-01-25 05:27:08,534 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:08,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:08,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:08,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:08,538 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:08,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:08,661 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-25 05:27:08,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:08,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:27:08,661 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:08,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:27:08,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:27:08,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:27:08,662 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 8 states. [2018-01-25 05:27:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:08,765 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-25 05:27:08,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:27:08,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-25 05:27:08,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:08,769 INFO L225 Difference]: With dead ends: 61 [2018-01-25 05:27:08,769 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 05:27:08,770 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:27:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 05:27:08,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2018-01-25 05:27:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 05:27:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-25 05:27:08,777 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2018-01-25 05:27:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:08,777 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-25 05:27:08,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:27:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-25 05:27:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:27:08,778 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:08,778 INFO L322 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-25 05:27:08,779 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:08,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1267324412, now seen corresponding path program 1 times [2018-01-25 05:27:08,779 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:08,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:08,780 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:08,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:08,781 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:08,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:08,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:08,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:27:08,837 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:08,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:27:08,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:27:08,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:27:08,838 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 6 states. [2018-01-25 05:27:08,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:08,923 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-01-25 05:27:08,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:27:08,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-25 05:27:08,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:08,927 INFO L225 Difference]: With dead ends: 50 [2018-01-25 05:27:08,927 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 05:27:08,928 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:27:08,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 05:27:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 05:27:08,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 05:27:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-25 05:27:08,934 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 20 [2018-01-25 05:27:08,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:08,934 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-25 05:27:08,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:27:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-25 05:27:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:27:08,935 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:08,935 INFO L322 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-25 05:27:08,936 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:08,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1267324411, now seen corresponding path program 1 times [2018-01-25 05:27:08,936 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:08,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:08,937 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:08,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:08,937 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:08,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:09,082 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-25 05:27:09,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:09,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:27:09,083 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:09,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:27:09,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:27:09,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:27:09,083 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 9 states. [2018-01-25 05:27:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:09,206 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-25 05:27:09,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:27:09,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-25 05:27:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:09,208 INFO L225 Difference]: With dead ends: 50 [2018-01-25 05:27:09,208 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 05:27:09,208 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:27:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 05:27:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 05:27:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 05:27:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-25 05:27:09,215 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 20 [2018-01-25 05:27:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:09,215 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-25 05:27:09,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:27:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-25 05:27:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:27:09,216 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:09,216 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:09,216 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:09,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951781, now seen corresponding path program 1 times [2018-01-25 05:27:09,217 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:09,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:09,218 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:09,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:09,218 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:09,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:09,275 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-25 05:27:09,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:09,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:27:09,275 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:09,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:27:09,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:27:09,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:27:09,276 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-01-25 05:27:09,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:09,378 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-25 05:27:09,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:27:09,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 05:27:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:09,379 INFO L225 Difference]: With dead ends: 49 [2018-01-25 05:27:09,379 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 05:27:09,379 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:27:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 05:27:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 05:27:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 05:27:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-25 05:27:09,385 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2018-01-25 05:27:09,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:09,386 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-25 05:27:09,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:27:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-25 05:27:09,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:27:09,387 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:09,387 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:09,387 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:09,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951782, now seen corresponding path program 1 times [2018-01-25 05:27:09,387 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:09,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:09,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:09,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:09,389 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:09,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:09,562 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-25 05:27:09,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:09,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:27:09,563 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:09,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:27:09,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:27:09,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:27:09,564 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 8 states. [2018-01-25 05:27:09,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:09,745 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-01-25 05:27:09,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:27:09,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-25 05:27:09,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:09,746 INFO L225 Difference]: With dead ends: 58 [2018-01-25 05:27:09,746 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 05:27:09,746 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:27:09,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 05:27:09,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-01-25 05:27:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 05:27:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-25 05:27:09,750 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 22 [2018-01-25 05:27:09,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:09,750 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-25 05:27:09,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:27:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-25 05:27:09,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:27:09,751 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:09,751 INFO L322 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] [2018-01-25 05:27:09,751 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:09,751 INFO L82 PathProgramCache]: Analyzing trace with hash -645685358, now seen corresponding path program 1 times [2018-01-25 05:27:09,751 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:09,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:09,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:09,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:09,752 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:09,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:09,804 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-25 05:27:09,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:09,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:27:09,804 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:09,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:27:09,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:27:09,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:27:09,805 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-01-25 05:27:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:09,900 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-25 05:27:09,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:27:09,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 05:27:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:09,901 INFO L225 Difference]: With dead ends: 49 [2018-01-25 05:27:09,901 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 05:27:09,901 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:27:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 05:27:09,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 05:27:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 05:27:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-25 05:27:09,905 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 24 [2018-01-25 05:27:09,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:09,905 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-25 05:27:09,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:27:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-25 05:27:09,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:27:09,906 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:09,906 INFO L322 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] [2018-01-25 05:27:09,906 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:09,906 INFO L82 PathProgramCache]: Analyzing trace with hash -645685357, now seen corresponding path program 1 times [2018-01-25 05:27:09,906 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:09,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:09,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:09,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:09,907 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:09,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:09,986 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-25 05:27:09,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:09,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:27:09,986 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:09,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:27:09,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:27:09,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:27:09,987 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 9 states. [2018-01-25 05:27:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:10,125 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-01-25 05:27:10,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:27:10,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-25 05:27:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:10,126 INFO L225 Difference]: With dead ends: 58 [2018-01-25 05:27:10,127 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 05:27:10,127 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:27:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 05:27:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2018-01-25 05:27:10,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 05:27:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-25 05:27:10,131 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 24 [2018-01-25 05:27:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:10,131 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-25 05:27:10,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:27:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-25 05:27:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:27:10,132 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:10,132 INFO L322 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] [2018-01-25 05:27:10,132 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:10,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1460131898, now seen corresponding path program 1 times [2018-01-25 05:27:10,133 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:10,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:10,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:10,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:10,134 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:10,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:10,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:10,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 05:27:10,519 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:10,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 05:27:10,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 05:27:10,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:27:10,520 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 12 states. [2018-01-25 05:27:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:10,781 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-01-25 05:27:10,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:27:10,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-01-25 05:27:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:10,782 INFO L225 Difference]: With dead ends: 106 [2018-01-25 05:27:10,783 INFO L226 Difference]: Without dead ends: 81 [2018-01-25 05:27:10,783 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-01-25 05:27:10,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-25 05:27:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-01-25 05:27:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-25 05:27:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-01-25 05:27:10,788 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 25 [2018-01-25 05:27:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:10,789 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-01-25 05:27:10,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 05:27:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-01-25 05:27:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:27:10,790 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:10,790 INFO L322 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] [2018-01-25 05:27:10,790 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:10,791 INFO L82 PathProgramCache]: Analyzing trace with hash -228811844, now seen corresponding path program 1 times [2018-01-25 05:27:10,791 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:10,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:10,792 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:10,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:10,792 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:10,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:11,009 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-25 05:27:11,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:11,010 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:27:11,011 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-25 05:27:11,013 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [11], [12], [19], [20], [26], [42], [47], [51], [55], [56], [57], [58], [59], [62], [73], [74], [75], [77] [2018-01-25 05:27:11,058 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:27:11,058 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:27:13,292 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:27:13,293 INFO L268 AbstractInterpreter]: Visited 24 different actions 32 times. Merged at 8 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-01-25 05:27:13,316 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:27:13,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:13,317 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 05:27:13,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:13,326 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:27:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:13,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:13,456 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 11 treesize of output 8 [2018-01-25 05:27:13,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:27:13,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:13,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:13,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:13,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-25 05:27:13,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-01-25 05:27:13,882 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 22 treesize of output 15 [2018-01-25 05:27:13,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:13,918 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 15 treesize of output 8 [2018-01-25 05:27:13,918 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:13,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-01-25 05:27:13,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:13,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:13,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:13,957 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-01-25 05:27:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:14,007 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:14,249 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 13 treesize of output 11 [2018-01-25 05:27:14,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-01-25 05:27:14,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:14,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:14,267 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-25 05:27:14,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-01-25 05:27:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:14,316 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:27:14,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [12] total 26 [2018-01-25 05:27:14,316 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:14,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:27:14,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:27:14,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-01-25 05:27:14,318 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 11 states. [2018-01-25 05:27:14,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:14,655 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-01-25 05:27:14,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:27:14,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-01-25 05:27:14,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:14,657 INFO L225 Difference]: With dead ends: 146 [2018-01-25 05:27:14,657 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 05:27:14,658 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 05:27:14,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 05:27:14,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 72. [2018-01-25 05:27:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-25 05:27:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-01-25 05:27:14,666 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 25 [2018-01-25 05:27:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:14,667 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-01-25 05:27:14,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:27:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-01-25 05:27:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:27:14,668 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:14,668 INFO L322 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] [2018-01-25 05:27:14,668 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:14,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2072010746, now seen corresponding path program 1 times [2018-01-25 05:27:14,669 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:14,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:14,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:14,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:14,670 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:14,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:15,015 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-25 05:27:15,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:15,015 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:27:15,015 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-25 05:27:15,016 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [11], [12], [19], [20], [26], [42], [47], [53], [55], [56], [57], [58], [59], [62], [73], [74], [75], [77] [2018-01-25 05:27:15,017 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:27:15,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:27:15,992 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:27:15,992 INFO L268 AbstractInterpreter]: Visited 24 different actions 32 times. Merged at 8 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-01-25 05:27:16,002 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:27:16,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:16,002 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 05:27:16,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:16,019 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:27:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:16,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:16,049 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-25 05:27:16,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:16,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:16,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:27:16,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:16,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:16,115 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-25 05:27:16,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:16,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:16,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-25 05:27:16,200 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-25 05:27:16,203 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-25 05:27:16,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:16,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:16,214 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-25 05:27:16,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-25 05:27:16,255 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 25 treesize of output 26 [2018-01-25 05:27:16,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-25 05:27:16,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:16,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:16,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-25 05:27:16,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-25 05:27:16,489 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 30 treesize of output 28 [2018-01-25 05:27:16,495 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 8 treesize of output 1 [2018-01-25 05:27:16,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:16,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:27:16,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:16,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:27:16,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:27:16,548 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-25 05:27:16,660 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-25 05:27:16,660 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:16,922 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-25 05:27:16,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:16,933 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 13 treesize of output 11 [2018-01-25 05:27:16,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:27:16,943 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:16,945 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:16,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:16,951 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-25 05:27:16,987 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-25 05:27:17,020 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:17,020 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:27:17,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:17,026 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:27:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:17,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:17,114 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-25 05:27:17,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:17,120 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-25 05:27:17,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:17,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:17,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:27:17,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:17,188 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-25 05:27:17,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:17,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:17,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:17,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-25 05:27:17,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:17,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:17,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 05:27:17,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:27:17,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 05:27:17,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:17,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:17,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:17,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-25 05:27:17,311 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-25 05:27:17,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 05:27:17,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:17,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:17,332 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-25 05:27:17,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-25 05:27:17,575 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 31 treesize of output 29 [2018-01-25 05:27:17,581 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 10 treesize of output 1 [2018-01-25 05:27:17,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:17,590 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-25 05:27:17,591 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:17,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:27:17,599 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-25 05:27:17,600 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-01-25 05:27:17,673 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-25 05:27:17,673 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:17,850 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 13 treesize of output 11 [2018-01-25 05:27:17,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-01-25 05:27:17,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:17,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:17,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:17,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-25 05:27:18,017 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-25 05:27:18,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:27:18,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9, 13, 11] total 47 [2018-01-25 05:27:18,019 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:27:18,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-25 05:27:18,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-25 05:27:18,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2085, Unknown=0, NotChecked=0, Total=2256 [2018-01-25 05:27:18,021 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 23 states. [2018-01-25 05:27:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:19,264 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-01-25 05:27:19,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 05:27:19,265 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-01-25 05:27:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:19,265 INFO L225 Difference]: With dead ends: 93 [2018-01-25 05:27:19,266 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 05:27:19,267 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=329, Invalid=3211, Unknown=0, NotChecked=0, Total=3540 [2018-01-25 05:27:19,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 05:27:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-01-25 05:27:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-25 05:27:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-01-25 05:27:19,277 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 25 [2018-01-25 05:27:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:19,277 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2018-01-25 05:27:19,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-25 05:27:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-01-25 05:27:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:27:19,278 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:19,279 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:19,279 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:19,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1662500005, now seen corresponding path program 1 times [2018-01-25 05:27:19,279 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:19,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:19,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:19,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:19,280 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:19,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:20,020 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:20,020 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:27:20,020 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-25 05:27:20,020 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [12], [14], [19], [20], [26], [42], [47], [53], [55], [56], [57], [58], [59], [62], [73], [74], [75], [77] [2018-01-25 05:27:20,021 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:27:20,022 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:27:20,837 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:27:20,838 INFO L268 AbstractInterpreter]: Visited 24 different actions 32 times. Merged at 8 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-01-25 05:27:20,844 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:27:20,844 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:20,844 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 05:27:20,859 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:20,860 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:27:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:20,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:20,904 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-25 05:27:20,912 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-25 05:27:20,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:20,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:20,939 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-25 05:27:20,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 05:27:21,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-01-25 05:27:21,245 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 27 treesize of output 20 [2018-01-25 05:27:21,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:21,263 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 20 treesize of output 18 [2018-01-25 05:27:21,264 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:21,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-01-25 05:27:21,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:21,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:27:21,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:27:21,332 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-01-25 05:27:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:21,368 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:21,729 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-25 05:27:21,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:21,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-25 05:27:21,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 24 treesize of output 16 [2018-01-25 05:27:21,772 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:21,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-25 05:27:21,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:21,795 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-01-25 05:27:21,795 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:21,799 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:21,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:21,809 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:69, output treesize:7 [2018-01-25 05:27:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:21,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:21,836 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:27:21,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:21,839 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:27:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:21,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:22,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:27:22,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:22,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:22,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-25 05:27:22,112 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 16 treesize of output 13 [2018-01-25 05:27:22,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 05:27:22,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:22,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:22,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:22,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-01-25 05:27:22,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-01-25 05:27:22,403 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 26 treesize of output 24 [2018-01-25 05:27:22,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:22,422 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-25 05:27:22,423 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:22,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:27:22,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:27:22,438 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-01-25 05:27:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:22,549 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:22,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-25 05:27:22,783 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 20 treesize of output 12 [2018-01-25 05:27:22,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:22,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 10 [2018-01-25 05:27:22,796 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:22,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 11 [2018-01-25 05:27:22,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:22,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:22,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:27:22,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:58, output treesize:39 [2018-01-25 05:27:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:22,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:27:22,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12, 16, 14] total 52 [2018-01-25 05:27:22,939 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:27:22,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-25 05:27:22,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-25 05:27:22,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2531, Unknown=0, NotChecked=0, Total=2756 [2018-01-25 05:27:22,940 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 23 states. [2018-01-25 05:27:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:25,177 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-01-25 05:27:25,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 05:27:25,177 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-01-25 05:27:25,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:25,178 INFO L225 Difference]: With dead ends: 80 [2018-01-25 05:27:25,178 INFO L226 Difference]: Without dead ends: 79 [2018-01-25 05:27:25,180 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=374, Invalid=3786, Unknown=0, NotChecked=0, Total=4160 [2018-01-25 05:27:25,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-25 05:27:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-25 05:27:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-25 05:27:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-01-25 05:27:25,190 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 27 [2018-01-25 05:27:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:25,190 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-01-25 05:27:25,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-25 05:27:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-01-25 05:27:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:27:25,192 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:25,192 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:25,192 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:25,192 INFO L82 PathProgramCache]: Analyzing trace with hash 65327996, now seen corresponding path program 1 times [2018-01-25 05:27:25,192 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:25,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:25,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:25,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:25,193 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:25,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:25,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:25,351 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:27:25,351 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 05:27:25,351 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [12], [19], [20], [22], [26], [42], [47], [53], [55], [56], [57], [58], [59], [62], [73], [74], [75], [77] [2018-01-25 05:27:25,352 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:27:25,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:27:25,935 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:27:25,935 INFO L268 AbstractInterpreter]: Visited 24 different actions 32 times. Merged at 8 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-01-25 05:27:25,944 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:27:25,944 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:25,944 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:27:25,958 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:25,958 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:27:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:25,979 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:25,996 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:26,016 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-25 05:27:26,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:26,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:26,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-01-25 05:27:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:26,058 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:26,058 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:27:26,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:26,061 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:27:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:26,097 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:26,101 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:26,105 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-01-25 05:27:26,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:26,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:26,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-01-25 05:27:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:26,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:27:26,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5, 5, 5] total 14 [2018-01-25 05:27:26,118 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:27:26,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:27:26,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:27:26,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:27:26,119 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 11 states. [2018-01-25 05:27:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:26,239 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-01-25 05:27:26,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:27:26,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-01-25 05:27:26,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:26,240 INFO L225 Difference]: With dead ends: 86 [2018-01-25 05:27:26,240 INFO L226 Difference]: Without dead ends: 84 [2018-01-25 05:27:26,240 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-01-25 05:27:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-25 05:27:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2018-01-25 05:27:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-25 05:27:26,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-01-25 05:27:26,247 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 29 [2018-01-25 05:27:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:26,247 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-01-25 05:27:26,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:27:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-01-25 05:27:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:27:26,248 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:26,248 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:26,248 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:26,248 INFO L82 PathProgramCache]: Analyzing trace with hash -580377695, now seen corresponding path program 1 times [2018-01-25 05:27:26,248 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:26,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:26,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:26,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:26,249 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:26,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:26,351 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-25 05:27:26,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:27:26,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:27:26,352 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:26,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:27:26,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:27:26,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:27:26,352 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 7 states. [2018-01-25 05:27:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:26,437 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-01-25 05:27:26,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:27:26,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-25 05:27:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:26,437 INFO L225 Difference]: With dead ends: 75 [2018-01-25 05:27:26,438 INFO L226 Difference]: Without dead ends: 40 [2018-01-25 05:27:26,438 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:27:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-25 05:27:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-25 05:27:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 05:27:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-01-25 05:27:26,442 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 31 [2018-01-25 05:27:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:26,442 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-01-25 05:27:26,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:27:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-01-25 05:27:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:27:26,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:26,443 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:26,443 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:26,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1644356119, now seen corresponding path program 1 times [2018-01-25 05:27:26,444 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:26,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:26,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:26,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:26,445 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:26,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:26,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:26,662 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:27:26,662 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-01-25 05:27:26,663 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [12], [17], [19], [20], [26], [30], [33], [36], [42], [47], [53], [55], [56], [57], [58], [59], [62], [73], [74], [75], [77] [2018-01-25 05:27:26,665 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:27:26,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:27:27,301 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:27:27,301 INFO L268 AbstractInterpreter]: Visited 27 different actions 38 times. Merged at 11 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-25 05:27:27,313 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:27:27,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:27,313 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:27:27,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:27,320 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:27:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:27,341 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:27,387 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:27,423 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-25 05:27:27,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:27,433 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2018-01-25 05:27:27,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:27,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:27:27,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2018-01-25 05:27:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:27,511 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:27:27,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [11] total 18 [2018-01-25 05:27:27,511 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:27:27,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:27:27,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:27:27,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-01-25 05:27:27,512 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 7 states. [2018-01-25 05:27:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:27,581 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-01-25 05:27:27,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:27:27,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-25 05:27:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:27,581 INFO L225 Difference]: With dead ends: 40 [2018-01-25 05:27:27,581 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 05:27:27,582 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-01-25 05:27:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 05:27:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-25 05:27:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 05:27:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-01-25 05:27:27,586 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 31 [2018-01-25 05:27:27,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:27,586 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-01-25 05:27:27,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:27:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-01-25 05:27:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:27:27,586 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:27,586 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:27,586 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:27,587 INFO L82 PathProgramCache]: Analyzing trace with hash 566109348, now seen corresponding path program 2 times [2018-01-25 05:27:27,587 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:27,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:27,587 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:27:27,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:27,588 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:27,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:27,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:27,968 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:27:27,968 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:27:27,968 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:27:27,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:27,968 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:27:27,973 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:27:27,973 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:27:27,985 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:27:27,993 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:27:27,998 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:27:28,001 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:28,009 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-25 05:27:28,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,014 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-25 05:27:28,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:27:28,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:28,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:28,058 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-25 05:27:28,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,065 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-25 05:27:28,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 05:27:28,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:27:28,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 05:27:28,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,118 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-25 05:27:28,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-25 05:27:28,149 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-25 05:27:28,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 05:27:28,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-25 05:27:28,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-25 05:27:28,493 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 34 treesize of output 32 [2018-01-25 05:27:28,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-25 05:27:28,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:28,508 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 10 treesize of output 1 [2018-01-25 05:27:28,508 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:28,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:27:28,520 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-25 05:27:28,520 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-25 05:27:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:28,599 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:29,015 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 15 treesize of output 13 [2018-01-25 05:27:29,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-01-25 05:27:29,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:44 [2018-01-25 05:27:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:29,215 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:29,216 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:27:29,219 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:27:29,219 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:27:29,235 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:27:29,266 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:27:29,302 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:27:29,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:29,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:27:29,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,331 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-25 05:27:29,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:27:29,384 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:29,384 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:27:29,385 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-25 05:27:29,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,392 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-25 05:27:29,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 05:27:29,485 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-25 05:27:29,487 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-25 05:27:29,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:27:29,548 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 28 treesize of output 29 [2018-01-25 05:27:29,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 05:27:29,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,558 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-25 05:27:29,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-01-25 05:27:29,718 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 34 treesize of output 32 [2018-01-25 05:27:29,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-25 05:27:29,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:29,740 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 10 treesize of output 1 [2018-01-25 05:27:29,740 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:27:29,757 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-25 05:27:29,757 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-25 05:27:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:29,766 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:29,959 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 15 treesize of output 13 [2018-01-25 05:27:29,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-01-25 05:27:29,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:29,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:27:29,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:35 [2018-01-25 05:27:30,628 WARN L143 SmtUtils]: Spent 477ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-25 05:27:31,034 WARN L143 SmtUtils]: Spent 331ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-25 05:27:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:31,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:27:31,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13, 15, 13] total 48 [2018-01-25 05:27:31,044 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:27:31,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-25 05:27:31,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-25 05:27:31,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2174, Unknown=0, NotChecked=0, Total=2352 [2018-01-25 05:27:31,045 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2018-01-25 05:27:31,764 WARN L146 SmtUtils]: Spent 306ms on a formula simplification. DAG size of input: 55 DAG size of output 39 [2018-01-25 05:27:32,912 WARN L146 SmtUtils]: Spent 942ms on a formula simplification. DAG size of input: 59 DAG size of output 46 [2018-01-25 05:27:33,344 WARN L146 SmtUtils]: Spent 384ms on a formula simplification. DAG size of input: 60 DAG size of output 47 [2018-01-25 05:27:39,691 WARN L143 SmtUtils]: Spent 1858ms on a formula simplification that was a NOOP. DAG size: 47 [2018-01-25 05:27:41,214 WARN L146 SmtUtils]: Spent 1480ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-01-25 05:27:41,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:27:41,338 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-01-25 05:27:41,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 05:27:41,339 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 32 [2018-01-25 05:27:41,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:27:41,339 INFO L225 Difference]: With dead ends: 37 [2018-01-25 05:27:41,339 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 05:27:41,340 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 88 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=395, Invalid=3387, Unknown=0, NotChecked=0, Total=3782 [2018-01-25 05:27:41,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 05:27:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-01-25 05:27:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-25 05:27:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-01-25 05:27:41,344 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-01-25 05:27:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:27:41,344 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-01-25 05:27:41,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-25 05:27:41,344 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-01-25 05:27:41,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 05:27:41,345 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:27:41,345 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:27:41,345 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 05:27:41,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1429764731, now seen corresponding path program 2 times [2018-01-25 05:27:41,345 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:27:41,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:41,346 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:27:41,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:27:41,346 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:27:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:27:41,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:27:41,746 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-25 05:27:41,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:41,746 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:27:41,746 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:27:41,746 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:27:41,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:41,746 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:27:41,753 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:27:41,754 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:27:41,766 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:27:41,773 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:27:41,776 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:27:41,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:41,781 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-25 05:27:41,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:41,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:41,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:27:41,828 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 16 treesize of output 13 [2018-01-25 05:27:41,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 05:27:41,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:41,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:41,837 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-25 05:27:41,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-01-25 05:27:42,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-01-25 05:27:42,171 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 29 treesize of output 27 [2018-01-25 05:27:42,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:42,187 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 21 treesize of output 16 [2018-01-25 05:27:42,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:42,189 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 15 treesize of output 8 [2018-01-25 05:27:42,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:42,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2018-01-25 05:27:42,213 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:42,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:27:42,239 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-25 05:27:42,240 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-01-25 05:27:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:42,286 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:27:50,186 WARN L143 SmtUtils]: Spent 250ms on a formula simplification that was a NOOP. DAG size: 43 [2018-01-25 05:27:51,814 WARN L143 SmtUtils]: Spent 1583ms on a formula simplification that was a NOOP. DAG size: 47 [2018-01-25 05:27:52,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2018-01-25 05:27:52,066 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-01-25 05:27:52,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:52,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:52,082 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-25 05:27:52,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:43 [2018-01-25 05:27:52,170 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-25 05:27:52,191 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:27:52,191 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:27:52,194 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:27:52,194 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:27:52,210 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:27:52,235 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:27:52,274 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:27:52,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:27:52,283 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-25 05:27:52,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:52,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:52,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:27:52,300 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 15 treesize of output 12 [2018-01-25 05:27:52,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-25 05:27:52,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:52,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:52,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:27:52,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 05:27:52,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-01-25 05:27:52,632 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 28 treesize of output 21 [2018-01-25 05:27:52,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:27:52,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 27 [2018-01-25 05:27:52,655 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:52,670 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 21 treesize of output 19 [2018-01-25 05:27:52,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-25 05:27:52,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:27:52,694 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-25 05:27:52,694 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-01-25 05:27:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:27:52,725 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-01-25 05:28:01,007 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:28:01,007 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:28:01,011 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:28:01,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:28:01 BoogieIcfgContainer [2018-01-25 05:28:01,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:28:01,012 INFO L168 Benchmark]: Toolchain (without parser) took 54428.53 ms. Allocated memory was 303.6 MB in the beginning and 864.0 MB in the end (delta: 560.5 MB). Free memory was 263.5 MB in the beginning and 580.7 MB in the end (delta: -317.2 MB). Peak memory consumption was 243.3 MB. Max. memory is 5.3 GB. [2018-01-25 05:28:01,012 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 303.6 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:28:01,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.75 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 252.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:28:01,012 INFO L168 Benchmark]: Boogie Preprocessor took 38.25 ms. Allocated memory is still 303.6 MB. Free memory was 252.3 MB in the beginning and 250.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:28:01,013 INFO L168 Benchmark]: RCFGBuilder took 287.93 ms. Allocated memory is still 303.6 MB. Free memory was 250.3 MB in the beginning and 232.2 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:28:01,013 INFO L168 Benchmark]: TraceAbstraction took 53860.41 ms. Allocated memory was 303.6 MB in the beginning and 864.0 MB in the end (delta: 560.5 MB). Free memory was 231.2 MB in the beginning and 580.7 MB in the end (delta: -349.4 MB). Peak memory consumption was 211.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:28:01,015 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.21 ms. Allocated memory is still 303.6 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 232.75 ms. Allocated memory is still 303.6 MB. Free memory was 262.5 MB in the beginning and 252.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.25 ms. Allocated memory is still 303.6 MB. Free memory was 252.3 MB in the beginning and 250.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 287.93 ms. Allocated memory is still 303.6 MB. Free memory was 250.3 MB in the beginning and 232.2 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53860.41 ms. Allocated memory was 303.6 MB in the beginning and 864.0 MB in the end (delta: 560.5 MB). Free memory was 231.2 MB in the beginning and 580.7 MB in the end (delta: -349.4 MB). Peak memory consumption was 211.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 9 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 287 LocStat_NO_SUPPORTING_DISEQUALITIES : 51 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 60 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 8.598574 RENAME_VARIABLES(MILLISECONDS) : 1.859313 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 8.523116 PROJECTAWAY(MILLISECONDS) : 12.923244 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.092867 DISJOIN(MILLISECONDS) : 0.598546 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.908765 ADD_EQUALITY(MILLISECONDS) : 0.030581 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012721 #CONJOIN_DISJUNCTIVE : 60 #RENAME_VARIABLES : 92 #UNFREEZE : 0 #CONJOIN : 109 #PROJECTAWAY : 78 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 89 #ADD_EQUALITY : 62 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 278 LocStat_NO_SUPPORTING_DISEQUALITIES : 47 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 60 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.483270 RENAME_VARIABLES(MILLISECONDS) : 1.061304 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 3.423441 PROJECTAWAY(MILLISECONDS) : 3.929176 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.156184 DISJOIN(MILLISECONDS) : 0.411169 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.099900 ADD_EQUALITY(MILLISECONDS) : 0.037120 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011522 #CONJOIN_DISJUNCTIVE : 59 #RENAME_VARIABLES : 92 #UNFREEZE : 0 #CONJOIN : 108 #PROJECTAWAY : 78 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 89 #ADD_EQUALITY : 62 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 275 LocStat_NO_SUPPORTING_DISEQUALITIES : 47 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 60 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.352711 RENAME_VARIABLES(MILLISECONDS) : 0.521222 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.305177 PROJECTAWAY(MILLISECONDS) : 2.335789 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.070332 DISJOIN(MILLISECONDS) : 0.410369 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.542786 ADD_EQUALITY(MILLISECONDS) : 0.023510 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007364 #CONJOIN_DISJUNCTIVE : 59 #RENAME_VARIABLES : 92 #UNFREEZE : 0 #CONJOIN : 108 #PROJECTAWAY : 78 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 89 #ADD_EQUALITY : 62 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 274 LocStat_NO_SUPPORTING_DISEQUALITIES : 47 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 60 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.143089 RENAME_VARIABLES(MILLISECONDS) : 0.481609 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.103001 PROJECTAWAY(MILLISECONDS) : 2.109306 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.059909 DISJOIN(MILLISECONDS) : 0.530538 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.501126 ADD_EQUALITY(MILLISECONDS) : 0.013143 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008151 #CONJOIN_DISJUNCTIVE : 59 #RENAME_VARIABLES : 92 #UNFREEZE : 0 #CONJOIN : 108 #PROJECTAWAY : 78 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 89 #ADD_EQUALITY : 62 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 320 LocStat_NO_SUPPORTING_DISEQUALITIES : 56 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 66 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 7.013724 RENAME_VARIABLES(MILLISECONDS) : 0.665593 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 3.325153 PROJECTAWAY(MILLISECONDS) : 0.065192 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.046641 DISJOIN(MILLISECONDS) : 0.484072 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.691632 ADD_EQUALITY(MILLISECONDS) : 0.011356 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006991 #CONJOIN_DISJUNCTIVE : 70 #RENAME_VARIABLES : 110 #UNFREEZE : 0 #CONJOIN : 123 #PROJECTAWAY : 90 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 107 #ADD_EQUALITY : 68 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 35 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 54 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 15 error locations. TIMEOUT Result, 53.8s OverallTime, 21 OverallIterations, 3 TraceHistogramMax, 16.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 662 SDtfs, 1001 SDslu, 2703 SDs, 0 SdLazy, 2556 SolverSat, 184 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 813 GetRequests, 436 SyntacticMatches, 20 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 3089 ImplicationChecksByTransitivity, 18.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.3s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 104 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 729 NumberOfCodeBlocks, 729 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 971 ConstructedInterpolants, 90 QuantifiedInterpolants, 249768 SizeOfPredicates, 137 NumberOfNonLiveVariables, 1471 ConjunctsInSsa, 325 ConjunctsInUnsatCore, 40 InterpolantComputations, 18 PerfectInterpolantSequences, 49/138 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-28-01-026.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-28-01-026.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-28-01-026.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-28-01-026.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-28-01-026.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-28-01-026.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-28-01-026.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_05-28-01-026.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_05-28-01-026.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-25_05-28-01-026.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-25_05-28-01-026.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-28-01-026.csv Completed graceful shutdown