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_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:31:07,429 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:31:07,432 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:31:07,447 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:31:07,448 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:31:07,449 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:31:07,450 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:31:07,452 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:31:07,454 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:31:07,455 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:31:07,456 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:31:07,456 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:31:07,457 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:31:07,458 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:31:07,459 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:31:07,462 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:31:07,464 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:31:07,466 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:31:07,468 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:31:07,469 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:31:07,472 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:31:07,472 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:31:07,472 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:31:07,473 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:31:07,474 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:31:07,476 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:31:07,476 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:31:07,477 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:31:07,477 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:31:07,477 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:31:07,478 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:31:07,478 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:31:07,487 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:31:07,488 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:31:07,488 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:31:07,488 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:31:07,489 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:31:07,489 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:31:07,489 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:31:07,489 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:31:07,489 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:31:07,490 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:31:07,490 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:31:07,490 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:31:07,490 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:31:07,490 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:31:07,490 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:31:07,491 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:31:07,491 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:31:07,491 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:31:07,491 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:31:07,491 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:31:07,491 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:31:07,491 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:31:07,492 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:31:07,492 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:31:07,492 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:31:07,492 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:31:07,493 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:31:07,493 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:31:07,493 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:31:07,493 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:31:07,493 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:31:07,493 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:31:07,493 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:31:07,493 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:31:07,494 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:31:07,494 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:31:07,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:31:07,539 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:31:07,542 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:31:07,543 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:31:07,543 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:31:07,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:31:07,727 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:31:07,734 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:31:07,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:31:07,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:31:07,741 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:31:07,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:31:07" (1/1) ... [2018-01-25 05:31:07,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0999f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:07, skipping insertion in model container [2018-01-25 05:31:07,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:31:07" (1/1) ... [2018-01-25 05:31:07,759 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:31:07,799 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:31:07,928 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:31:07,949 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:31:07,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:07 WrapperNode [2018-01-25 05:31:07,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:31:07,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:31:07,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:31:07,959 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:31:07,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:07" (1/1) ... [2018-01-25 05:31:07,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:07" (1/1) ... [2018-01-25 05:31:07,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:07" (1/1) ... [2018-01-25 05:31:07,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:07" (1/1) ... [2018-01-25 05:31:07,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:07" (1/1) ... [2018-01-25 05:31:07,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:07" (1/1) ... [2018-01-25 05:31:07,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:07" (1/1) ... [2018-01-25 05:31:07,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:31:07,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:31:07,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:31:07,999 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:31:08,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:07" (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:31:08,057 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:31:08,057 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:31:08,058 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-25 05:31:08,058 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-25 05:31:08,058 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-01-25 05:31:08,058 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:31:08,058 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:31:08,058 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:31:08,059 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:31:08,059 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:31:08,059 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:31:08,059 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:31:08,059 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-25 05:31:08,059 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-25 05:31:08,060 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-01-25 05:31:08,060 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:31:08,060 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:31:08,060 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:31:08,389 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:31:08,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:31:08 BoogieIcfgContainer [2018-01-25 05:31:08,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:31:08,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:31:08,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:31:08,393 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:31:08,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:31:07" (1/3) ... [2018-01-25 05:31:08,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee329ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:31:08, skipping insertion in model container [2018-01-25 05:31:08,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:31:07" (2/3) ... [2018-01-25 05:31:08,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee329ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:31:08, skipping insertion in model container [2018-01-25 05:31:08,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:31:08" (3/3) ... [2018-01-25 05:31:08,398 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:31:08,407 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:31:08,416 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-25 05:31:08,465 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:31:08,465 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:31:08,466 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:31:08,466 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:31:08,466 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:31:08,466 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:31:08,466 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:31:08,466 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:31:08,467 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:31:08,489 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-01-25 05:31:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:31:08,494 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:08,495 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:31:08,495 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:08,499 INFO L82 PathProgramCache]: Analyzing trace with hash -718609434, now seen corresponding path program 1 times [2018-01-25 05:31:08,501 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:08,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:08,541 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:08,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:08,542 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:08,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:08,718 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:31:08,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:08,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:31:08,721 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:08,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:31:08,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:31:08,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:31:08,813 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-01-25 05:31:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:08,971 INFO L93 Difference]: Finished difference Result 147 states and 171 transitions. [2018-01-25 05:31:08,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:31:08,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 05:31:08,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:08,979 INFO L225 Difference]: With dead ends: 147 [2018-01-25 05:31:08,979 INFO L226 Difference]: Without dead ends: 86 [2018-01-25 05:31:08,982 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:31:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-25 05:31:09,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-25 05:31:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-25 05:31:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-01-25 05:31:09,019 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 13 [2018-01-25 05:31:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:09,019 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-01-25 05:31:09,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:31:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-01-25 05:31:09,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:31:09,020 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:09,020 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:31:09,020 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:09,021 INFO L82 PathProgramCache]: Analyzing trace with hash -718609433, now seen corresponding path program 1 times [2018-01-25 05:31:09,021 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:09,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:09,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:09,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:09,022 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:09,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:09,209 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:31:09,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:09,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:31:09,210 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:09,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:31:09,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:31:09,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:31:09,212 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-01-25 05:31:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:09,412 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-01-25 05:31:09,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:31:09,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 05:31:09,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:09,414 INFO L225 Difference]: With dead ends: 86 [2018-01-25 05:31:09,414 INFO L226 Difference]: Without dead ends: 85 [2018-01-25 05:31:09,415 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:31:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-25 05:31:09,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-25 05:31:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-25 05:31:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-01-25 05:31:09,426 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 13 [2018-01-25 05:31:09,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:09,427 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-01-25 05:31:09,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:31:09,427 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-01-25 05:31:09,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:31:09,427 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:09,428 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:31:09,428 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:09,428 INFO L82 PathProgramCache]: Analyzing trace with hash -802055959, now seen corresponding path program 1 times [2018-01-25 05:31:09,428 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:09,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:09,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:09,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:09,430 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:09,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:09,475 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:31:09,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:09,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:31:09,475 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:09,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:31:09,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:31:09,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:31:09,476 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-01-25 05:31:09,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:09,544 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-01-25 05:31:09,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:31:09,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:31:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:09,546 INFO L225 Difference]: With dead ends: 85 [2018-01-25 05:31:09,546 INFO L226 Difference]: Without dead ends: 84 [2018-01-25 05:31:09,546 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:31:09,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-25 05:31:09,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-25 05:31:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-25 05:31:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-01-25 05:31:09,556 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2018-01-25 05:31:09,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:09,556 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-01-25 05:31:09,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:31:09,556 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-01-25 05:31:09,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:31:09,557 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:09,557 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:31:09,557 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:09,558 INFO L82 PathProgramCache]: Analyzing trace with hash -802055958, now seen corresponding path program 1 times [2018-01-25 05:31:09,558 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:09,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:09,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:09,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:09,559 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:09,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:09,653 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:31:09,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:09,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:31:09,654 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:09,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:31:09,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:31:09,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:31:09,655 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2018-01-25 05:31:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:09,696 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-01-25 05:31:09,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:31:09,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:31:09,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:09,697 INFO L225 Difference]: With dead ends: 84 [2018-01-25 05:31:09,698 INFO L226 Difference]: Without dead ends: 83 [2018-01-25 05:31:09,698 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:31:09,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-25 05:31:09,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-25 05:31:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-25 05:31:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-01-25 05:31:09,705 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-01-25 05:31:09,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:09,706 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-01-25 05:31:09,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:31:09,706 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-01-25 05:31:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:31:09,707 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:09,707 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:31:09,707 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:09,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880583, now seen corresponding path program 1 times [2018-01-25 05:31:09,707 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:09,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:09,708 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:09,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:09,709 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:09,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:09,755 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:31:09,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:09,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:31:09,756 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:09,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:31:09,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:31:09,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:31:09,757 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-01-25 05:31:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:09,847 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-01-25 05:31:09,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:31:09,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 05:31:09,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:09,849 INFO L225 Difference]: With dead ends: 83 [2018-01-25 05:31:09,849 INFO L226 Difference]: Without dead ends: 82 [2018-01-25 05:31:09,850 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:31:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-25 05:31:09,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-25 05:31:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-25 05:31:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-01-25 05:31:09,858 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 17 [2018-01-25 05:31:09,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:09,859 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-01-25 05:31:09,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:31:09,859 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-01-25 05:31:09,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:31:09,860 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:09,860 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:31:09,860 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:09,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880582, now seen corresponding path program 1 times [2018-01-25 05:31:09,861 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:09,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:09,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:09,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:09,862 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:09,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:09,945 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:31:09,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:09,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:31:09,946 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:09,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:31:09,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:31:09,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:31:09,947 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-01-25 05:31:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:10,080 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-01-25 05:31:10,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:31:10,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-25 05:31:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:10,081 INFO L225 Difference]: With dead ends: 82 [2018-01-25 05:31:10,081 INFO L226 Difference]: Without dead ends: 81 [2018-01-25 05:31:10,081 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:31:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-25 05:31:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-25 05:31:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-25 05:31:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-01-25 05:31:10,090 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 17 [2018-01-25 05:31:10,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:10,091 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-01-25 05:31:10,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:31:10,091 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-01-25 05:31:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:31:10,092 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:10,092 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] [2018-01-25 05:31:10,092 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:10,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098626, now seen corresponding path program 1 times [2018-01-25 05:31:10,093 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:10,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:10,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:10,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:10,094 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:10,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:10,178 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:31:10,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:10,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:31:10,179 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:10,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:31:10,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:31:10,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:31:10,180 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 7 states. [2018-01-25 05:31:10,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:10,331 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-01-25 05:31:10,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:31:10,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-25 05:31:10,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:10,332 INFO L225 Difference]: With dead ends: 81 [2018-01-25 05:31:10,333 INFO L226 Difference]: Without dead ends: 80 [2018-01-25 05:31:10,333 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:31:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-25 05:31:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-25 05:31:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-25 05:31:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-01-25 05:31:10,338 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 23 [2018-01-25 05:31:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:10,339 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-01-25 05:31:10,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:31:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-01-25 05:31:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:31:10,339 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:10,339 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] [2018-01-25 05:31:10,340 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:10,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098625, now seen corresponding path program 1 times [2018-01-25 05:31:10,340 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:10,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:10,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:10,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:10,341 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:10,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:10,505 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:31:10,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:10,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:31:10,506 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:10,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:31:10,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:31:10,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:31:10,507 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 10 states. [2018-01-25 05:31:10,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:10,679 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2018-01-25 05:31:10,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 05:31:10,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-25 05:31:10,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:10,682 INFO L225 Difference]: With dead ends: 165 [2018-01-25 05:31:10,682 INFO L226 Difference]: Without dead ends: 104 [2018-01-25 05:31:10,683 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-01-25 05:31:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-25 05:31:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-01-25 05:31:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-25 05:31:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-01-25 05:31:10,691 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 23 [2018-01-25 05:31:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:10,692 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-01-25 05:31:10,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:31:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-01-25 05:31:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:31:10,693 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:10,693 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] [2018-01-25 05:31:10,693 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:10,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1390800317, now seen corresponding path program 1 times [2018-01-25 05:31:10,693 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:10,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:10,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:10,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:10,695 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:10,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:11,197 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:31:11,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:11,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-25 05:31:11,197 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:11,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 05:31:11,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 05:31:11,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:31:11,198 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 16 states. [2018-01-25 05:31:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:12,038 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2018-01-25 05:31:12,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 05:31:12,039 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-01-25 05:31:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:12,041 INFO L225 Difference]: With dead ends: 153 [2018-01-25 05:31:12,041 INFO L226 Difference]: Without dead ends: 152 [2018-01-25 05:31:12,042 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-01-25 05:31:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-25 05:31:12,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 131. [2018-01-25 05:31:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-25 05:31:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2018-01-25 05:31:12,058 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 23 [2018-01-25 05:31:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:12,058 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2018-01-25 05:31:12,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 05:31:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2018-01-25 05:31:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:31:12,059 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:12,060 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] [2018-01-25 05:31:12,060 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:12,060 INFO L82 PathProgramCache]: Analyzing trace with hash -197547585, now seen corresponding path program 1 times [2018-01-25 05:31:12,060 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:12,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:12,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:12,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:12,061 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:12,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:12,311 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:31:12,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:12,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 05:31:12,311 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:12,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 05:31:12,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 05:31:12,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:31:12,312 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand 13 states. [2018-01-25 05:31:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:12,696 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2018-01-25 05:31:12,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 05:31:12,696 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-01-25 05:31:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:12,698 INFO L225 Difference]: With dead ends: 150 [2018-01-25 05:31:12,698 INFO L226 Difference]: Without dead ends: 149 [2018-01-25 05:31:12,699 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-01-25 05:31:12,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-25 05:31:12,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 96. [2018-01-25 05:31:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 05:31:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-01-25 05:31:12,707 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 23 [2018-01-25 05:31:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:12,707 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-01-25 05:31:12,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 05:31:12,708 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-01-25 05:31:12,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:31:12,709 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:12,709 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, 1, 1] [2018-01-25 05:31:12,709 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:12,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1853436480, now seen corresponding path program 1 times [2018-01-25 05:31:12,710 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:12,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:12,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:12,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:12,711 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:12,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:12,931 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:31:12,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:31:12,932 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:31:12,933 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-25 05:31:12,934 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [9], [14], [16], [25], [28], [36], [38], [39], [40], [41], [42], [45], [104], [105], [108], [111], [155], [156], [157], [159], [161] [2018-01-25 05:31:12,978 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:31:12,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:31:14,285 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:31:14,287 INFO L268 AbstractInterpreter]: Visited 26 different actions 31 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-25 05:31:14,298 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:31:14,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:31:14,298 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:31:14,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:14,311 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:31:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:14,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:31:14,383 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:31:14,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:14,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:14,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:31:14,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:31:14,445 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:31:14,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:14,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:14,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:14,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 05:31:14,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-25 05:31:14,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 05:31:14,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:31:14,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:31:14,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:31:14,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-25 05:31:14,931 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:31:14,931 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:31:15,409 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:31:15,421 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:31:15,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:15,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:15,430 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:31:15,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-25 05:31:15,553 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:31:15,575 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:31:15,575 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 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 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:31:15,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:15,579 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:31:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:15,636 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:31:15,639 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:31:15,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:15,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:15,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:31:15,646 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:31:15,647 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:31:15,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:15,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:15,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:15,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 05:31:15,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-25 05:31:15,676 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:31:15,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:31:15,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:31:15,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:31:15,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-25 05:31:15,699 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:31:15,699 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:31:15,771 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:31:15,781 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:31:15,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:15,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:15,818 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:31:15,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-25 05:31:15,826 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:31:15,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:31:15,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12] total 32 [2018-01-25 05:31:15,828 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:31:15,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-25 05:31:15,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-25 05:31:15,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 05:31:15,830 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 22 states. [2018-01-25 05:31:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:16,725 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-01-25 05:31:16,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 05:31:16,726 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-01-25 05:31:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:16,727 INFO L225 Difference]: With dead ends: 101 [2018-01-25 05:31:16,727 INFO L226 Difference]: Without dead ends: 100 [2018-01-25 05:31:16,728 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=273, Invalid=1889, Unknown=0, NotChecked=0, Total=2162 [2018-01-25 05:31:16,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-25 05:31:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-01-25 05:31:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 05:31:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-01-25 05:31:16,738 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 27 [2018-01-25 05:31:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:16,738 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-01-25 05:31:16,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-25 05:31:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-01-25 05:31:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:31:16,739 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:16,740 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] [2018-01-25 05:31:16,740 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:16,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1699013504, now seen corresponding path program 1 times [2018-01-25 05:31:16,740 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:16,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:16,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:16,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:16,741 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:16,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:16,850 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:31:16,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:16,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:31:16,851 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:16,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:31:16,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:31:16,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:31:16,851 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2018-01-25 05:31:17,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:17,043 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-01-25 05:31:17,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:31:17,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-25 05:31:17,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:17,044 INFO L225 Difference]: With dead ends: 93 [2018-01-25 05:31:17,044 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 05:31:17,045 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:31:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 05:31:17,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-25 05:31:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-25 05:31:17,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-01-25 05:31:17,051 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 28 [2018-01-25 05:31:17,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:17,051 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-01-25 05:31:17,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:31:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-01-25 05:31:17,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:31:17,052 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:17,052 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:31:17,052 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:17,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682038, now seen corresponding path program 1 times [2018-01-25 05:31:17,052 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:17,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:17,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:17,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:17,053 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:17,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:17,132 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:31:17,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:17,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:31:17,133 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:17,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:31:17,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:31:17,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:31:17,134 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 6 states. [2018-01-25 05:31:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:17,277 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-01-25 05:31:17,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:31:17,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-25 05:31:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:17,278 INFO L225 Difference]: With dead ends: 68 [2018-01-25 05:31:17,278 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 05:31:17,279 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:31:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 05:31:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-25 05:31:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 05:31:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-25 05:31:17,285 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 31 [2018-01-25 05:31:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:17,285 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-25 05:31:17,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:31:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-25 05:31:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:31:17,287 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:17,287 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:31:17,287 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:17,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682039, now seen corresponding path program 1 times [2018-01-25 05:31:17,287 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:17,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:17,289 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:17,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:17,289 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:17,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:17,488 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:31:17,488 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:17,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:31:17,489 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:17,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:31:17,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:31:17,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:31:17,489 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 9 states. [2018-01-25 05:31:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:17,613 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-01-25 05:31:17,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:31:17,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-25 05:31:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:17,614 INFO L225 Difference]: With dead ends: 73 [2018-01-25 05:31:17,614 INFO L226 Difference]: Without dead ends: 72 [2018-01-25 05:31:17,615 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:31:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-25 05:31:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-01-25 05:31:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 05:31:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-01-25 05:31:17,621 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 31 [2018-01-25 05:31:17,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:17,621 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-01-25 05:31:17,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:31:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-01-25 05:31:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 05:31:17,622 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:17,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:31:17,623 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:17,623 INFO L82 PathProgramCache]: Analyzing trace with hash -211494479, now seen corresponding path program 1 times [2018-01-25 05:31:17,623 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:17,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:17,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:17,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:17,624 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:17,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:17,976 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:31:17,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:17,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-25 05:31:17,976 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:17,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 05:31:17,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 05:31:17,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:31:17,978 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 13 states. [2018-01-25 05:31:18,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:18,218 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2018-01-25 05:31:18,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 05:31:18,218 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-01-25 05:31:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:18,219 INFO L225 Difference]: With dead ends: 127 [2018-01-25 05:31:18,219 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 05:31:18,220 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-01-25 05:31:18,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 05:31:18,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-25 05:31:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 05:31:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-25 05:31:18,227 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 36 [2018-01-25 05:31:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:18,228 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-25 05:31:18,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 05:31:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-25 05:31:18,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 05:31:18,228 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:18,228 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:31:18,229 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:18,229 INFO L82 PathProgramCache]: Analyzing trace with hash -188862225, now seen corresponding path program 1 times [2018-01-25 05:31:18,229 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:18,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:18,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:18,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:18,230 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:18,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:18,519 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:31:18,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:31:18,519 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:31:18,519 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-01-25 05:31:18,520 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [12], [20], [21], [25], [30], [36], [38], [39], [40], [41], [42], [45], [104], [105], [108], [111], [113], [117], [121], [122], [124], [125], [129], [135], [155], [156], [157], [159], [161], [162] [2018-01-25 05:31:18,521 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:31:18,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:31:19,472 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:31:19,473 INFO L268 AbstractInterpreter]: Visited 35 different actions 45 times. Merged at 6 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-25 05:31:19,488 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:31:19,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:31:19,488 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:31:19,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:19,496 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:31:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:19,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:31:19,536 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:31:19,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:19,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:19,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:31:19,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:31:19,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:31:19,594 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:31:19,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:19,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:19,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-25 05:31:19,664 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:31:19,666 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:31:19,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:19,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:19,682 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:31:19,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-25 05:31:19,735 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:31:19,738 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:31:19,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:19,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:19,778 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:31:19,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-25 05:31:22,160 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:31:22,168 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:31:22,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:31:22,176 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:31:22,176 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:22,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:31:22,188 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:31:22,188 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-25 05:31:22,258 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:31:22,259 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:31:22,558 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:31:22,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:22,566 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:31:22,575 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:31:22,576 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:22,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:22,582 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:31:22,582 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-25 05:31:22,613 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:31:22,634 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:31:22,634 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:31:22,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:22,638 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:31:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:22,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:31:22,706 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:31:22,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:22,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:31:22,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:22,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:22,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:31:22,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:31:22,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:31:22,814 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:31:22,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:22,826 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:31:22,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:22,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:22,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 05:31:22,890 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:31:22,893 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:31:22,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:22,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:22,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:22,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-25 05:31:22,941 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:31:22,943 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:31:22,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:22,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:22,951 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:31:22,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-25 05:31:35,305 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:31:35,307 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:31:35,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:35,316 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:31:35,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:31:35,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:31:35,325 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:31:35,325 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-01-25 05:31:35,492 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:31:35,492 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:31:35,778 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:31:35,785 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:31:35,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:35,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:35,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:35,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-25 05:31:35,962 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:31:35,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:31:35,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 11, 15, 12] total 56 [2018-01-25 05:31:35,964 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:31:35,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-25 05:31:35,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-25 05:31:35,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2977, Unknown=6, NotChecked=0, Total=3192 [2018-01-25 05:31:35,965 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 27 states. [2018-01-25 05:31:38,379 WARN L146 SmtUtils]: Spent 2040ms on a formula simplification. DAG size of input: 74 DAG size of output 53 [2018-01-25 05:31:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:41,316 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2018-01-25 05:31:41,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 05:31:41,316 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-01-25 05:31:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:41,317 INFO L225 Difference]: With dead ends: 110 [2018-01-25 05:31:41,317 INFO L226 Difference]: Without dead ends: 109 [2018-01-25 05:31:41,318 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 96 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=389, Invalid=4297, Unknown=6, NotChecked=0, Total=4692 [2018-01-25 05:31:41,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-25 05:31:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2018-01-25 05:31:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-25 05:31:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2018-01-25 05:31:41,327 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 36 [2018-01-25 05:31:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:41,327 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2018-01-25 05:31:41,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-25 05:31:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2018-01-25 05:31:41,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-25 05:31:41,328 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:41,329 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:31:41,329 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:41,329 INFO L82 PathProgramCache]: Analyzing trace with hash -7823713, now seen corresponding path program 1 times [2018-01-25 05:31:41,329 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:41,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:41,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:41,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:41,330 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:41,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:41,410 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:31:41,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:41,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:31:41,410 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:41,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:31:41,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:31:41,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:31:41,411 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 7 states. [2018-01-25 05:31:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:41,510 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2018-01-25 05:31:41,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:31:41,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-25 05:31:41,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:41,511 INFO L225 Difference]: With dead ends: 97 [2018-01-25 05:31:41,511 INFO L226 Difference]: Without dead ends: 95 [2018-01-25 05:31:41,511 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:31:41,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-25 05:31:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-25 05:31:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-25 05:31:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2018-01-25 05:31:41,521 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 39 [2018-01-25 05:31:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:41,521 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2018-01-25 05:31:41,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:31:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2018-01-25 05:31:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-25 05:31:41,522 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:41,522 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:31:41,522 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:41,522 INFO L82 PathProgramCache]: Analyzing trace with hash -7823712, now seen corresponding path program 1 times [2018-01-25 05:31:41,523 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:41,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:41,523 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:41,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:41,523 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:41,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:41,650 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:31:41,651 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:31:41,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:31:41,651 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:31:41,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:31:41,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:31:41,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:31:41,652 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand 8 states. [2018-01-25 05:31:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:31:41,761 INFO L93 Difference]: Finished difference Result 190 states and 231 transitions. [2018-01-25 05:31:41,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:31:41,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-01-25 05:31:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:31:41,762 INFO L225 Difference]: With dead ends: 190 [2018-01-25 05:31:41,762 INFO L226 Difference]: Without dead ends: 133 [2018-01-25 05:31:41,763 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:31:41,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-25 05:31:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-01-25 05:31:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-25 05:31:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 154 transitions. [2018-01-25 05:31:41,788 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 154 transitions. Word has length 39 [2018-01-25 05:31:41,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:31:41,789 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 154 transitions. [2018-01-25 05:31:41,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:31:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2018-01-25 05:31:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 05:31:41,789 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:31:41,790 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:31:41,790 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 05:31:41,790 INFO L82 PathProgramCache]: Analyzing trace with hash -701857031, now seen corresponding path program 2 times [2018-01-25 05:31:41,790 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:31:41,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:41,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:31:41,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:31:41,791 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:31:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:31:41,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:31:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:31:42,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:31:42,281 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:31:42,281 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:31:42,281 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:31:42,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:31:42,282 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:31:42,286 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:31:42,287 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:31:42,299 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:31:42,304 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:31:42,306 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:31:42,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:31:42,311 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:31:42,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:42,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:31:42,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:42,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:42,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:31:42,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:31:42,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-25 05:31:42,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:42,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:31:42,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:31:42,363 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:31:42,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:42,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:42,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 05:31:42,412 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:31:42,414 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:31:42,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:42,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:42,425 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:31:42,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-25 05:31:42,469 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:31:42,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 05:31:42,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:42,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:42,481 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:31:42,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-25 05:31:47,899 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:31:47,900 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:31:47,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:47,909 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:31:47,909 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:31:47,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:31:47,921 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:31:47,921 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-25 05:31:48,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:31:48,005 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:31:48,532 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:31:48,540 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:31:48,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:48,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:48,550 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:31:48,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-01-25 05:31:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:31:48,724 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:31:48,725 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:31:48,729 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:31:48,729 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:31:48,747 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:31:48,791 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:31:48,826 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:31:48,833 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:31:48,837 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:31:48,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:48,843 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:31:48,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:48,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:48,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:31:48,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:31:48,884 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:31:48,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:48,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:31:48,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:31:48,898 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:31:48,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:48,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:48,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 05:31:49,001 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:31:49,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-25 05:31:49,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:49,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:49,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:49,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:31:49,067 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:31:49,068 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:31:49,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:49,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:49,077 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:31:49,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-01-25 05:31:51,444 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:31:51,450 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:31:51,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:51,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:31:51,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:31:51,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:31:51,482 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:31:51,482 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-25 05:31:51,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:31:51,495 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:31:51,646 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:31:51,656 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:31:51,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:31:51,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:31:51,664 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:31:51,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-25 05:31:52,190 WARN L143 SmtUtils]: Spent 365ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-25 05:31:52,594 WARN L143 SmtUtils]: Spent 336ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-25 05:31:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:31:52,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:31:52,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 14, 17, 14] total 50 [2018-01-25 05:31:52,609 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:31:52,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-25 05:31:52,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-25 05:31:52,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2370, Unknown=2, NotChecked=0, Total=2550 [2018-01-25 05:31:52,610 INFO L87 Difference]: Start difference. First operand 131 states and 154 transitions. Second operand 31 states. [2018-01-25 05:31:55,400 WARN L146 SmtUtils]: Spent 2062ms on a formula simplification. DAG size of input: 80 DAG size of output 59 [2018-01-25 05:31:56,248 WARN L146 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 88 DAG size of output 61 [2018-01-25 05:32:02,388 WARN L146 SmtUtils]: Spent 2275ms on a formula simplification. DAG size of input: 49 DAG size of output 48 Received shutdown request... [2018-01-25 05:32:06,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 05:32:06,213 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:32:06,217 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:32:06,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:32:06 BoogieIcfgContainer [2018-01-25 05:32:06,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:32:06,218 INFO L168 Benchmark]: Toolchain (without parser) took 58491.05 ms. Allocated memory was 307.2 MB in the beginning and 711.5 MB in the end (delta: 404.2 MB). Free memory was 265.1 MB in the beginning and 423.6 MB in the end (delta: -158.4 MB). Peak memory consumption was 245.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:06,219 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 307.2 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:32:06,220 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.02 ms. Allocated memory is still 307.2 MB. Free memory was 264.1 MB in the beginning and 253.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:06,220 INFO L168 Benchmark]: Boogie Preprocessor took 38.84 ms. Allocated memory is still 307.2 MB. Free memory was 253.2 MB in the beginning and 251.2 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:32:06,220 INFO L168 Benchmark]: RCFGBuilder took 391.61 ms. Allocated memory is still 307.2 MB. Free memory was 251.2 MB in the beginning and 225.2 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:06,221 INFO L168 Benchmark]: TraceAbstraction took 57826.75 ms. Allocated memory was 307.2 MB in the beginning and 711.5 MB in the end (delta: 404.2 MB). Free memory was 225.2 MB in the beginning and 423.6 MB in the end (delta: -198.4 MB). Peak memory consumption was 205.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:32:06,223 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.14 ms. Allocated memory is still 307.2 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 224.02 ms. Allocated memory is still 307.2 MB. Free memory was 264.1 MB in the beginning and 253.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.84 ms. Allocated memory is still 307.2 MB. Free memory was 253.2 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 391.61 ms. Allocated memory is still 307.2 MB. Free memory was 251.2 MB in the beginning and 225.2 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57826.75 ms. Allocated memory was 307.2 MB in the beginning and 711.5 MB in the end (delta: 404.2 MB). Free memory was 225.2 MB in the beginning and 423.6 MB in the end (delta: -198.4 MB). Peak memory consumption was 205.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 9 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 239 LocStat_NO_SUPPORTING_DISEQUALITIES : 59 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 60 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.054727 RENAME_VARIABLES(MILLISECONDS) : 0.329442 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.999677 PROJECTAWAY(MILLISECONDS) : 0.325049 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.081574 DISJOIN(MILLISECONDS) : 0.227729 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.362138 ADD_EQUALITY(MILLISECONDS) : 0.018070 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015587 #CONJOIN_DISJUNCTIVE : 55 #RENAME_VARIABLES : 84 #UNFREEZE : 0 #CONJOIN : 103 #PROJECTAWAY : 78 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 81 #ADD_EQUALITY : 62 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 368 LocStat_NO_SUPPORTING_DISEQUALITIES : 112 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 43 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 69 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 44 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.588979 RENAME_VARIABLES(MILLISECONDS) : 0.397683 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.550563 PROJECTAWAY(MILLISECONDS) : 0.150945 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.077189 DISJOIN(MILLISECONDS) : 0.475742 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.429684 ADD_EQUALITY(MILLISECONDS) : 0.021712 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009884 #CONJOIN_DISJUNCTIVE : 75 #RENAME_VARIABLES : 129 #UNFREEZE : 0 #CONJOIN : 133 #PROJECTAWAY : 113 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 124 #ADD_EQUALITY : 71 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (131states) and interpolant automaton (currently 18 states, 31 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 90 locations, 21 error locations. TIMEOUT Result, 57.7s OverallTime, 19 OverallIterations, 3 TraceHistogramMax, 23.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1371 SDtfs, 1084 SDslu, 6235 SDs, 0 SdLazy, 3533 SolverSat, 238 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 672 GetRequests, 323 SyntacticMatches, 21 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2774 ImplicationChecksByTransitivity, 39.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 107 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 31.2s InterpolantComputationTime, 696 NumberOfCodeBlocks, 696 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 873 ConstructedInterpolants, 142 QuantifiedInterpolants, 362504 SizeOfPredicates, 113 NumberOfNonLiveVariables, 928 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 6/67 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_cstrstr-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-32-06-233.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-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-32-06-233.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-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-32-06-233.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-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-32-06-233.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-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-32-06-233.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-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-32-06-233.csv Completed graceful shutdown