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_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:36:21,994 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:36:21,995 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:36:22,010 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:36:22,011 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:36:22,012 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:36:22,013 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:36:22,015 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:36:22,017 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:36:22,018 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:36:22,019 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:36:22,019 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:36:22,020 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:36:22,021 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:36:22,022 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:36:22,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:36:22,027 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:36:22,029 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:36:22,031 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:36:22,032 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:36:22,034 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:36:22,034 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:36:22,035 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:36:22,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:36:22,036 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:36:22,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:36:22,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:36:22,039 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:36:22,039 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:36:22,039 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:36:22,039 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:36:22,040 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_preciseopt.epf [2018-01-25 02:36:22,049 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:36:22,050 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:36:22,050 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:36:22,051 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:36:22,051 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:36:22,051 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:36:22,051 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:36:22,051 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:36:22,051 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:36:22,052 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:36:22,052 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:36:22,053 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:36:22,053 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:36:22,053 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:36:22,053 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:36:22,053 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:36:22,054 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:36:22,054 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:36:22,054 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:36:22,054 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:36:22,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:36:22,055 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:36:22,055 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:36:22,055 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:36:22,055 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:36:22,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:36:22,056 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:36:22,056 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:36:22,056 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:36:22,056 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:36:22,056 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:36:22,056 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:36:22,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:36:22,057 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:36:22,057 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:36:22,058 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:36:22,058 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:36:22,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:36:22,109 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:36:22,114 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:36:22,116 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:36:22,116 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:36:22,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:36:22,331 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:36:22,338 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:36:22,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:36:22,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:36:22,349 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:36:22,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:36:22" (1/1) ... [2018-01-25 02:36:22,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577bb5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:22, skipping insertion in model container [2018-01-25 02:36:22,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:36:22" (1/1) ... [2018-01-25 02:36:22,394 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:36:22,457 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:36:22,600 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:36:22,617 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:36:22,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:22 WrapperNode [2018-01-25 02:36:22,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:36:22,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:36:22,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:36:22,626 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:36:22,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:22" (1/1) ... [2018-01-25 02:36:22,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:22" (1/1) ... [2018-01-25 02:36:22,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:22" (1/1) ... [2018-01-25 02:36:22,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:22" (1/1) ... [2018-01-25 02:36:22,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:22" (1/1) ... [2018-01-25 02:36:22,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:22" (1/1) ... [2018-01-25 02:36:22,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:22" (1/1) ... [2018-01-25 02:36:22,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:36:22,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:36:22,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:36:22,672 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:36:22,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:22" (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 02:36:22,741 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:36:22,742 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:36:22,742 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-01-25 02:36:22,742 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:36:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:36:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:36:22,742 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:36:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:36:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:36:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:36:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-01-25 02:36:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:36:22,743 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:36:22,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:36:22,994 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:36:22,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:36:22 BoogieIcfgContainer [2018-01-25 02:36:22,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:36:22,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:36:22,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:36:22,999 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:36:22,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:36:22" (1/3) ... [2018-01-25 02:36:23,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6c30cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:36:23, skipping insertion in model container [2018-01-25 02:36:23,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:22" (2/3) ... [2018-01-25 02:36:23,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6c30cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:36:23, skipping insertion in model container [2018-01-25 02:36:23,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:36:22" (3/3) ... [2018-01-25 02:36:23,004 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:36:23,015 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:36:23,023 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 02:36:23,065 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:36:23,065 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:36:23,065 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:36:23,065 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:36:23,066 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:36:23,066 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:36:23,066 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:36:23,066 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:36:23,067 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:36:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-25 02:36:23,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:36:23,094 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:23,095 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:36:23,095 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:36:23,099 INFO L82 PathProgramCache]: Analyzing trace with hash -21044599, now seen corresponding path program 1 times [2018-01-25 02:36:23,101 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:23,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:23,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:23,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:23,146 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:23,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:23,352 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 02:36:23,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:23,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:36:23,355 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:23,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:36:23,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:36:23,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:36:23,445 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-01-25 02:36:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:23,608 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-01-25 02:36:23,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:36:23,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 02:36:23,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:23,622 INFO L225 Difference]: With dead ends: 96 [2018-01-25 02:36:23,622 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 02:36:23,627 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:36:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 02:36:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 02:36:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 02:36:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-25 02:36:23,661 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-01-25 02:36:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:23,661 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-25 02:36:23,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:36:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-25 02:36:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:36:23,662 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:23,662 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:36:23,662 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:36:23,662 INFO L82 PathProgramCache]: Analyzing trace with hash -21044598, now seen corresponding path program 1 times [2018-01-25 02:36:23,662 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:23,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:23,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:23,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:23,664 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:23,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:23,899 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 02:36:23,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:23,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:36:23,899 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:23,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:36:23,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:36:23,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:36:23,902 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-01-25 02:36:24,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:24,141 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-25 02:36:24,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:36:24,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 02:36:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:24,143 INFO L225 Difference]: With dead ends: 54 [2018-01-25 02:36:24,143 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 02:36:24,144 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:36:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 02:36:24,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 02:36:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 02:36:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-25 02:36:24,161 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-01-25 02:36:24,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:24,161 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-25 02:36:24,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:36:24,162 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-25 02:36:24,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:36:24,162 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:24,162 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:36:24,163 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:36:24,163 INFO L82 PathProgramCache]: Analyzing trace with hash -652382516, now seen corresponding path program 1 times [2018-01-25 02:36:24,172 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:24,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:24,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:24,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:24,174 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:24,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:24,218 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 02:36:24,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:24,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:36:24,219 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:24,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:36:24,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:36:24,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:36:24,220 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-01-25 02:36:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:24,283 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-25 02:36:24,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:36:24,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:36:24,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:24,285 INFO L225 Difference]: With dead ends: 53 [2018-01-25 02:36:24,285 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 02:36:24,285 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 02:36:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 02:36:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 02:36:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 02:36:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-25 02:36:24,293 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-01-25 02:36:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:24,293 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-25 02:36:24,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:36:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-25 02:36:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:36:24,294 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:24,294 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:36:24,295 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:36:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash -652382515, now seen corresponding path program 1 times [2018-01-25 02:36:24,295 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:24,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:24,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:24,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:24,297 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:24,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:24,374 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 02:36:24,374 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:24,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:36:24,374 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:24,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:36:24,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:36:24,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:36:24,375 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-25 02:36:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:24,463 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-25 02:36:24,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:36:24,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 02:36:24,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:24,466 INFO L225 Difference]: With dead ends: 52 [2018-01-25 02:36:24,466 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 02:36:24,466 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 02:36:24,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 02:36:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 02:36:24,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 02:36:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-25 02:36:24,473 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-01-25 02:36:24,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:24,474 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-25 02:36:24,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:36:24,474 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-25 02:36:24,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:36:24,475 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:24,475 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:36:24,475 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:36:24,476 INFO L82 PathProgramCache]: Analyzing trace with hash 470787565, now seen corresponding path program 1 times [2018-01-25 02:36:24,476 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:24,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:24,477 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:24,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:24,477 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:24,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:24,535 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 02:36:24,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:24,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:36:24,536 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:24,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:36:24,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:36:24,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:36:24,538 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-01-25 02:36:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:24,622 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-25 02:36:24,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:36:24,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 02:36:24,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:24,624 INFO L225 Difference]: With dead ends: 51 [2018-01-25 02:36:24,624 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 02:36:24,624 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 02:36:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 02:36:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 02:36:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 02:36:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-25 02:36:24,630 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-01-25 02:36:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:24,630 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-25 02:36:24,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:36:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-25 02:36:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:36:24,631 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:24,631 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:36:24,631 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:36:24,631 INFO L82 PathProgramCache]: Analyzing trace with hash 470787566, now seen corresponding path program 1 times [2018-01-25 02:36:24,631 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:24,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:24,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:24,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:24,633 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:24,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:24,744 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 02:36:24,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:24,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:36:24,745 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:24,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:36:24,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:36:24,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:36:24,745 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-01-25 02:36:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:24,875 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-01-25 02:36:24,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:36:24,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-25 02:36:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:24,879 INFO L225 Difference]: With dead ends: 75 [2018-01-25 02:36:24,879 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 02:36:24,879 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:36:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 02:36:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-01-25 02:36:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 02:36:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-25 02:36:24,885 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-01-25 02:36:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:24,885 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-25 02:36:24,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:36:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-25 02:36:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:36:24,886 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:24,886 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 02:36:24,886 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:36:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash 947097224, now seen corresponding path program 1 times [2018-01-25 02:36:24,887 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:24,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:24,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:24,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:24,888 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:24,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:24,938 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 02:36:24,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:24,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:36:24,939 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:24,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:36:24,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:36:24,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:36:24,940 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-01-25 02:36:25,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:25,030 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-01-25 02:36:25,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:36:25,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-25 02:36:25,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:25,032 INFO L225 Difference]: With dead ends: 56 [2018-01-25 02:36:25,032 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 02:36:25,032 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:36:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 02:36:25,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-01-25 02:36:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:36:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-25 02:36:25,039 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-01-25 02:36:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:25,039 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-25 02:36:25,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:36:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-25 02:36:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:36:25,040 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:25,040 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 02:36:25,040 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:36:25,041 INFO L82 PathProgramCache]: Analyzing trace with hash 947097225, now seen corresponding path program 1 times [2018-01-25 02:36:25,041 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:25,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:25,042 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:25,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:25,042 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:25,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:25,228 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 02:36:25,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:25,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:36:25,228 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:25,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:36:25,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:36:25,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:36:25,229 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-01-25 02:36:25,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:25,385 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-25 02:36:25,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:36:25,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-25 02:36:25,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:25,386 INFO L225 Difference]: With dead ends: 70 [2018-01-25 02:36:25,386 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 02:36:25,387 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:36:25,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 02:36:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-01-25 02:36:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 02:36:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-01-25 02:36:25,396 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-01-25 02:36:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:25,396 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-01-25 02:36:25,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:36:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-01-25 02:36:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 02:36:25,397 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:25,397 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 02:36:25,397 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:36:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1236428998, now seen corresponding path program 1 times [2018-01-25 02:36:25,398 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:25,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:25,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:25,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:25,399 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:25,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:25,567 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 02:36:25,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:25,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:36:25,568 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:25,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:36:25,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:36:25,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:36:25,568 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 6 states. [2018-01-25 02:36:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:25,809 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-01-25 02:36:25,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:36:25,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-25 02:36:25,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:25,810 INFO L225 Difference]: With dead ends: 58 [2018-01-25 02:36:25,811 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 02:36:25,811 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:36:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 02:36:25,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 02:36:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 02:36:25,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-25 02:36:25,821 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-01-25 02:36:25,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:25,821 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-25 02:36:25,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:36:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-25 02:36:25,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 02:36:25,822 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:25,822 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] [2018-01-25 02:36:25,822 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:36:25,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1333847614, now seen corresponding path program 1 times [2018-01-25 02:36:25,823 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:25,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:25,823 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:25,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:25,824 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:25,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:25,916 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 02:36:25,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:25,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:36:25,916 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:25,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:36:25,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:36:25,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:36:25,917 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-01-25 02:36:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:25,926 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-01-25 02:36:25,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:36:25,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-25 02:36:25,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:25,927 INFO L225 Difference]: With dead ends: 78 [2018-01-25 02:36:25,927 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 02:36:25,928 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:36:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 02:36:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 02:36:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:36:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-25 02:36:25,936 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-01-25 02:36:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:25,936 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-25 02:36:25,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:36:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-25 02:36:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 02:36:25,938 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:25,938 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] [2018-01-25 02:36:25,938 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:36:25,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1745742785, now seen corresponding path program 1 times [2018-01-25 02:36:25,938 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:25,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:25,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:25,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:25,940 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:25,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 02:36:26,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:26,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 02:36:26,315 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:26,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 02:36:26,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 02:36:26,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:36:26,316 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-01-25 02:36:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:26,496 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-01-25 02:36:26,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 02:36:26,496 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-25 02:36:26,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:26,497 INFO L225 Difference]: With dead ends: 93 [2018-01-25 02:36:26,497 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 02:36:26,498 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-01-25 02:36:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 02:36:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 02:36:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:36:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-25 02:36:26,505 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2018-01-25 02:36:26,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:26,506 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-25 02:36:26,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 02:36:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-25 02:36:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 02:36:26,507 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:26,507 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] [2018-01-25 02:36:26,507 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:36:26,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1611729279, now seen corresponding path program 1 times [2018-01-25 02:36:26,507 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:26,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:26,509 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:26,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:26,509 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:26,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:26,741 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 02:36:26,741 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:26,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 02:36:26,741 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:26,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 02:36:26,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 02:36:26,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:36:26,742 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-01-25 02:36:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:26,885 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-01-25 02:36:26,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 02:36:26,888 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-25 02:36:26,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:26,889 INFO L225 Difference]: With dead ends: 107 [2018-01-25 02:36:26,889 INFO L226 Difference]: Without dead ends: 77 [2018-01-25 02:36:26,890 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-01-25 02:36:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-25 02:36:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-01-25 02:36:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-25 02:36:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-01-25 02:36:26,902 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2018-01-25 02:36:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:26,902 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-01-25 02:36:26,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 02:36:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-01-25 02:36:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 02:36:26,904 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:26,904 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] [2018-01-25 02:36:26,904 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:36:26,904 INFO L82 PathProgramCache]: Analyzing trace with hash -193709055, now seen corresponding path program 1 times [2018-01-25 02:36:26,904 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:26,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:26,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:26,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:26,906 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:26,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:27,411 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 02:36:27,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:36:27,412 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:36:27,413 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-25 02:36:27,416 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [14], [15], [18], [22], [24], [26], [27], [30], [31], [34], [42], [63], [68], [74], [76], [77], [78], [79], [80], [83], [94], [95], [96], [98] [2018-01-25 02:36:27,467 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:36:27,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:36:56,544 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:36:56,545 INFO L268 AbstractInterpreter]: Visited 29 different actions 45 times. Merged at 8 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-25 02:36:56,594 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:36:56,594 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:36:56,594 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 02:36:56,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:56,602 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:36:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:56,662 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:36:56,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-25 02:36:56,755 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 02:36:56,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:56,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:56,795 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 02:36:56,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 02:36:57,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-25 02:36:57,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-25 02:36:57,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:36:57,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:36:57,048 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 02:36:57,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-25 02:36:57,195 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 02:36:57,195 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:36:57,596 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 02:36:57,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:57,603 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 02:36:57,612 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 02:36:57,612 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:57,622 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:57,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:57,633 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-25 02:36:57,643 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 02:36:57,678 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:36:57,678 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 02:36:57,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:57,683 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:36:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:57,760 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:36:57,765 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 02:36:57,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:57,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:57,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 02:36:57,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 02:36:57,844 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 02:36:57,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:57,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:57,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:57,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 02:36:58,013 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 02:36:58,043 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 16 [2018-01-25 02:36:58,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:36:58,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:36:58,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:36:58,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-25 02:36:58,264 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 02:36:58,264 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:36:58,445 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 02:36:58,454 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 02:36:58,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:36:58,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:58,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:36:58,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 02:36:58,578 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 02:36:58,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:36:58,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 12, 12] total 41 [2018-01-25 02:36:58,581 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:36:58,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 02:36:58,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 02:36:58,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2018-01-25 02:36:58,583 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 20 states. [2018-01-25 02:36:58,802 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 28 DAG size of output 22 [2018-01-25 02:36:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:59,929 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-25 02:36:59,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 02:36:59,930 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-01-25 02:36:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:59,932 INFO L225 Difference]: With dead ends: 106 [2018-01-25 02:36:59,932 INFO L226 Difference]: Without dead ends: 103 [2018-01-25 02:36:59,933 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=320, Invalid=2332, Unknown=0, NotChecked=0, Total=2652 [2018-01-25 02:36:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-25 02:36:59,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-01-25 02:36:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-25 02:36:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-01-25 02:36:59,947 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 30 [2018-01-25 02:36:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:59,947 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-01-25 02:36:59,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 02:36:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-01-25 02:36:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 02:36:59,949 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:59,949 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] [2018-01-25 02:36:59,949 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:36:59,949 INFO L82 PathProgramCache]: Analyzing trace with hash -276872451, now seen corresponding path program 1 times [2018-01-25 02:36:59,949 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:59,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:59,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:59,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:59,950 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:59,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:37:00,295 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 02:37:00,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:37:00,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 02:37:00,296 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:37:00,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 02:37:00,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 02:37:00,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:37:00,297 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 10 states. [2018-01-25 02:37:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:37:00,619 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-01-25 02:37:00,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 02:37:00,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-25 02:37:00,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:37:00,620 INFO L225 Difference]: With dead ends: 132 [2018-01-25 02:37:00,621 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 02:37:00,621 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-01-25 02:37:00,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 02:37:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-01-25 02:37:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 02:37:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-25 02:37:00,628 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 31 [2018-01-25 02:37:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:37:00,628 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-25 02:37:00,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 02:37:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-25 02:37:00,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 02:37:00,629 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:37:00,629 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] [2018-01-25 02:37:00,629 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:37:00,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1615321176, now seen corresponding path program 1 times [2018-01-25 02:37:00,630 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:37:00,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:00,630 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:37:00,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:00,631 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:37:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:37:00,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:37:01,128 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 02:37:01,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:37:01,128 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:37:01,128 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-25 02:37:01,128 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [9], [14], [15], [18], [22], [24], [27], [30], [31], [34], [40], [46], [52], [54], [63], [68], [74], [76], [77], [78], [79], [80], [83], [94], [95], [96], [98] [2018-01-25 02:37:01,130 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:37:01,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 02:37:15,972 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 02:37:15,973 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 02:37:15,973 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:37:15,973 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:37:15,973 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 02:37:15,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:37:15,991 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:37:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:37:16,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:37:16,014 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 02:37:16,015 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:37:16,018 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:37:16,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:37:16 BoogieIcfgContainer [2018-01-25 02:37:16,019 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:37:16,019 INFO L168 Benchmark]: Toolchain (without parser) took 53688.23 ms. Allocated memory was 302.0 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 260.3 MB in the beginning and 387.8 MB in the end (delta: -127.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-01-25 02:37:16,020 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 302.0 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:37:16,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.52 ms. Allocated memory is still 302.0 MB. Free memory was 259.3 MB in the beginning and 249.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-25 02:37:16,020 INFO L168 Benchmark]: Boogie Preprocessor took 45.42 ms. Allocated memory is still 302.0 MB. Free memory was 249.1 MB in the beginning and 247.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:37:16,021 INFO L168 Benchmark]: RCFGBuilder took 323.89 ms. Allocated memory is still 302.0 MB. Free memory was 247.1 MB in the beginning and 227.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-01-25 02:37:16,021 INFO L168 Benchmark]: TraceAbstraction took 53022.49 ms. Allocated memory was 302.0 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 227.5 MB in the beginning and 387.8 MB in the end (delta: -160.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-01-25 02:37:16,023 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.22 ms. Allocated memory is still 302.0 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 285.52 ms. Allocated memory is still 302.0 MB. Free memory was 259.3 MB in the beginning and 249.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.42 ms. Allocated memory is still 302.0 MB. Free memory was 249.1 MB in the beginning and 247.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 323.89 ms. Allocated memory is still 302.0 MB. Free memory was 247.1 MB in the beginning and 227.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53022.49 ms. Allocated memory was 302.0 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 227.5 MB in the beginning and 387.8 MB in the end (delta: -160.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 378 LocStat_NO_SUPPORTING_DISEQUALITIES : 82 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.594702 RENAME_VARIABLES(MILLISECONDS) : 0.335786 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.532708 PROJECTAWAY(MILLISECONDS) : 0.969314 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.086126 DISJOIN(MILLISECONDS) : 0.437354 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.368858 ADD_EQUALITY(MILLISECONDS) : 0.015506 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011458 #CONJOIN_DISJUNCTIVE : 81 #RENAME_VARIABLES : 135 #UNFREEZE : 0 #CONJOIN : 140 #PROJECTAWAY : 109 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 70 #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 547). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. TIMEOUT Result, 52.9s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 551 SDtfs, 836 SDslu, 1415 SDs, 0 SdLazy, 1286 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 107 SyntacticMatches, 6 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 44.0s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 57 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 373 NumberOfCodeBlocks, 373 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 415 ConstructedInterpolants, 14 QuantifiedInterpolants, 71331 SizeOfPredicates, 25 NumberOfNonLiveVariables, 268 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 8/18 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/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-37-16-035.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-37-16-035.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-37-16-035.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-37-16-035.csv Completed graceful shutdown