java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.0_true-valid-memsafety.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-acfac67
[2018-01-28 21:34:46,884 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-01-28 21:34:46,886 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-28 21:34:46,900 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-28 21:34:46,900 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-28 21:34:46,901 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-28 21:34:46,902 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-28 21:34:46,904 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-28 21:34:46,905 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-28 21:34:46,906 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-28 21:34:46,906 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-28 21:34:46,907 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-28 21:34:46,907 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-28 21:34:46,908 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-28 21:34:46,909 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-28 21:34:46,911 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-28 21:34:46,913 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-28 21:34:46,915 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-28 21:34:46,916 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-28 21:34:46,917 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-28 21:34:46,920 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-28 21:34:46,920 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-28 21:34:46,920 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-28 21:34:46,921 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-28 21:34:46,922 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-28 21:34:46,923 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-28 21:34:46,923 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-28 21:34:46,924 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-28 21:34:46,924 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-28 21:34:46,924 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-28 21:34:46,925 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-01-28 21:34:46,925 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf
[2018-01-28 21:34:46,935 INFO L110 SettingsManager]: Loading preferences was successful
[2018-01-28 21:34:46,935 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-28 21:34:46,936 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-28 21:34:46,936 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-01-28 21:34:46,936 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-28 21:34:46,937 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-28 21:34:46,937 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true
[2018-01-28 21:34:46,938 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-28 21:34:46,938 INFO L133 SettingsManager]: * sizeof long=4
[2018-01-28 21:34:46,938 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-01-28 21:34:46,938 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-01-28 21:34:46,938 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-01-28 21:34:46,938 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-01-28 21:34:46,939 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-01-28 21:34:46,939 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-01-28 21:34:46,939 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-01-28 21:34:46,939 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-28 21:34:46,939 INFO L133 SettingsManager]: * sizeof long double=12
[2018-01-28 21:34:46,940 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-28 21:34:46,940 INFO L133 SettingsManager]: * Size of a code block=SingleStatement
[2018-01-28 21:34:46,940 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-01-28 21:34:46,940 INFO L133 SettingsManager]: * Add additional assume for each assert=false
[2018-01-28 21:34:46,940 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-01-28 21:34:46,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-28 21:34:46,941 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-28 21:34:46,941 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-01-28 21:34:46,941 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-01-28 21:34:46,941 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-28 21:34:46,942 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-01-28 21:34:46,942 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-28 21:34:46,942 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-28 21:34:46,942 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-28 21:34:46,943 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-28 21:34:46,943 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR
[2018-01-28 21:34:46,977 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-28 21:34:46,989 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-28 21:34:46,993 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-28 21:34:46,995 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-01-28 21:34:46,995 INFO L276 PluginConnector]: CDTParser initialized
[2018-01-28 21:34:46,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.0_true-valid-memsafety.i
[2018-01-28 21:34:47,177 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-28 21:34:47,184 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-28 21:34:47,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-28 21:34:47,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-28 21:34:47,191 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-28 21:34:47,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:34:47" (1/1) ...
[2018-01-28 21:34:47,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75200bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:47, skipping insertion in model container
[2018-01-28 21:34:47,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:34:47" (1/1) ...
[2018-01-28 21:34:47,212 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-28 21:34:47,251 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-28 21:34:47,365 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-28 21:34:47,382 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-28 21:34:47,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:47 WrapperNode
[2018-01-28 21:34:47,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-28 21:34:47,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-28 21:34:47,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-28 21:34:47,390 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-01-28 21:34:47,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:47" (1/1) ...
[2018-01-28 21:34:47,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:47" (1/1) ...
[2018-01-28 21:34:47,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:47" (1/1) ...
[2018-01-28 21:34:47,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:47" (1/1) ...
[2018-01-28 21:34:47,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:47" (1/1) ...
[2018-01-28 21:34:47,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:47" (1/1) ...
[2018-01-28 21:34:47,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:47" (1/1) ...
[2018-01-28 21:34:47,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-28 21:34:47,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-28 21:34:47,426 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-01-28 21:34:47,426 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-01-28 21:34:47,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:47" (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-28 21:34:47,473 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-28 21:34:47,473 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-28 21:34:47,473 INFO L136 BoogieDeclarations]: Found implementation of procedure push
[2018-01-28 21:34:47,473 INFO L136 BoogieDeclarations]: Found implementation of procedure pop
[2018-01-28 21:34:47,474 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-01-28 21:34:47,474 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-01-28 21:34:47,474 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-01-28 21:34:47,474 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-01-28 21:34:47,474 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-01-28 21:34:47,474 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-28 21:34:47,474 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-28 21:34:47,474 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-28 21:34:47,474 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-01-28 21:34:47,474 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-01-28 21:34:47,475 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-28 21:34:47,475 INFO L128 BoogieDeclarations]: Found specification of procedure push
[2018-01-28 21:34:47,475 INFO L128 BoogieDeclarations]: Found specification of procedure pop
[2018-01-28 21:34:47,475 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-01-28 21:34:47,475 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-28 21:34:47,475 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-28 21:34:47,852 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-28 21:34:47,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:34:47 BoogieIcfgContainer
[2018-01-28 21:34:47,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-28 21:34:47,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-28 21:34:47,855 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-01-28 21:34:47,858 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-01-28 21:34:47,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:34:47" (1/3) ...
[2018-01-28 21:34:47,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df52fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:34:47, skipping insertion in model container
[2018-01-28 21:34:47,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:34:47" (2/3) ...
[2018-01-28 21:34:47,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df52fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:34:47, skipping insertion in model container
[2018-01-28 21:34:47,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:34:47" (3/3) ...
[2018-01-28 21:34:47,862 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.0_true-valid-memsafety.i
[2018-01-28 21:34:47,871 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-28 21:34:47,877 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations.
[2018-01-28 21:34:47,927 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-01-28 21:34:47,927 INFO L323 AbstractCegarLoop]: Hoare is true
[2018-01-28 21:34:47,928 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-28 21:34:47,928 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-28 21:34:47,928 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-28 21:34:47,928 INFO L327 AbstractCegarLoop]: Difference is false
[2018-01-28 21:34:47,928 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-28 21:34:47,928 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-28 21:34:47,929 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-28 21:34:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states.
[2018-01-28 21:34:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-01-28 21:34:47,957 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:34:47,958 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:34:47,958 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:34:47,963 INFO L82 PathProgramCache]: Analyzing trace with hash -535779211, now seen corresponding path program 1 times
[2018-01-28 21:34:47,965 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:34:47,966 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:34:48,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:48,013 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:48,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:48,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:34:48,127 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-28 21:34:48,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 21:34:48,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-01-28 21:34:48,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states
[2018-01-28 21:34:48,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2018-01-28 21:34:48,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-01-28 21:34:48,143 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 2 states.
[2018-01-28 21:34:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:34:48,256 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions.
[2018-01-28 21:34:48,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2018-01-28 21:34:48,258 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19
[2018-01-28 21:34:48,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:34:48,269 INFO L225 Difference]: With dead ends: 139
[2018-01-28 21:34:48,269 INFO L226 Difference]: Without dead ends: 119
[2018-01-28 21:34:48,271 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-01-28 21:34:48,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2018-01-28 21:34:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119.
[2018-01-28 21:34:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states.
[2018-01-28 21:34:48,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions.
[2018-01-28 21:34:48,305 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 19
[2018-01-28 21:34:48,305 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:34:48,305 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions.
[2018-01-28 21:34:48,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2018-01-28 21:34:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions.
[2018-01-28 21:34:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-01-28 21:34:48,306 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:34:48,306 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:34:48,307 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:34:48,307 INFO L82 PathProgramCache]: Analyzing trace with hash -234455602, now seen corresponding path program 1 times
[2018-01-28 21:34:48,307 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:34:48,307 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:34:48,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:48,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:48,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:48,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:34:48,381 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-28 21:34:48,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 21:34:48,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-28 21:34:48,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-28 21:34:48,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-28 21:34:48,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-28 21:34:48,384 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand 3 states.
[2018-01-28 21:34:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:34:48,417 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions.
[2018-01-28 21:34:48,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-28 21:34:48,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24
[2018-01-28 21:34:48,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:34:48,420 INFO L225 Difference]: With dead ends: 136
[2018-01-28 21:34:48,421 INFO L226 Difference]: Without dead ends: 120
[2018-01-28 21:34:48,422 INFO L533 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-28 21:34:48,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2018-01-28 21:34:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120.
[2018-01-28 21:34:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states.
[2018-01-28 21:34:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions.
[2018-01-28 21:34:48,434 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 24
[2018-01-28 21:34:48,434 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:34:48,434 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions.
[2018-01-28 21:34:48,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-28 21:34:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions.
[2018-01-28 21:34:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-01-28 21:34:48,435 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:34:48,436 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:34:48,436 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:34:48,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1638530351, now seen corresponding path program 1 times
[2018-01-28 21:34:48,436 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:34:48,436 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:34:48,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:48,438 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:48,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:48,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:34:48,560 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-28 21:34:48,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 21:34:48,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-28 21:34:48,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-28 21:34:48,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-28 21:34:48,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-28 21:34:48,561 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand 3 states.
[2018-01-28 21:34:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:34:48,590 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions.
[2018-01-28 21:34:48,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-28 21:34:48,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26
[2018-01-28 21:34:48,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:34:48,593 INFO L225 Difference]: With dead ends: 226
[2018-01-28 21:34:48,593 INFO L226 Difference]: Without dead ends: 212
[2018-01-28 21:34:48,593 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-28 21:34:48,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states.
[2018-01-28 21:34:48,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 193.
[2018-01-28 21:34:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states.
[2018-01-28 21:34:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 238 transitions.
[2018-01-28 21:34:48,612 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 238 transitions. Word has length 26
[2018-01-28 21:34:48,612 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:34:48,612 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 238 transitions.
[2018-01-28 21:34:48,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-28 21:34:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions.
[2018-01-28 21:34:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2018-01-28 21:34:48,613 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:34:48,614 INFO L330 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]
[2018-01-28 21:34:48,614 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:34:48,614 INFO L82 PathProgramCache]: Analyzing trace with hash 745165149, now seen corresponding path program 1 times
[2018-01-28 21:34:48,614 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:34:48,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:34:48,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:48,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:48,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:48,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:34:48,659 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-28 21:34:48,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 21:34:48,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-01-28 21:34:48,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-28 21:34:48,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-28 21:34:48,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-28 21:34:48,661 INFO L87 Difference]: Start difference. First operand 193 states and 238 transitions. Second operand 3 states.
[2018-01-28 21:34:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:34:48,737 INFO L93 Difference]: Finished difference Result 246 states and 304 transitions.
[2018-01-28 21:34:48,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-28 21:34:48,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27
[2018-01-28 21:34:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:34:48,739 INFO L225 Difference]: With dead ends: 246
[2018-01-28 21:34:48,740 INFO L226 Difference]: Without dead ends: 239
[2018-01-28 21:34:48,740 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-28 21:34:48,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states.
[2018-01-28 21:34:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 230.
[2018-01-28 21:34:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states.
[2018-01-28 21:34:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 287 transitions.
[2018-01-28 21:34:48,761 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 287 transitions. Word has length 27
[2018-01-28 21:34:48,762 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:34:48,762 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 287 transitions.
[2018-01-28 21:34:48,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-28 21:34:48,762 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 287 transitions.
[2018-01-28 21:34:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-01-28 21:34:48,763 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:34:48,763 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:34:48,764 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:34:48,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1650110100, now seen corresponding path program 1 times
[2018-01-28 21:34:48,764 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:34:48,764 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:34:48,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:48,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:48,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:48,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:34:48,830 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-28 21:34:48,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 21:34:48,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-28 21:34:48,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-28 21:34:48,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-28 21:34:48,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-28 21:34:48,831 INFO L87 Difference]: Start difference. First operand 230 states and 287 transitions. Second operand 4 states.
[2018-01-28 21:34:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:34:48,972 INFO L93 Difference]: Finished difference Result 396 states and 497 transitions.
[2018-01-28 21:34:48,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-28 21:34:48,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32
[2018-01-28 21:34:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:34:48,976 INFO L225 Difference]: With dead ends: 396
[2018-01-28 21:34:48,976 INFO L226 Difference]: Without dead ends: 392
[2018-01-28 21:34:48,977 INFO L533 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-28 21:34:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2018-01-28 21:34:49,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 363.
[2018-01-28 21:34:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states.
[2018-01-28 21:34:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 468 transitions.
[2018-01-28 21:34:49,007 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 468 transitions. Word has length 32
[2018-01-28 21:34:49,007 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:34:49,007 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 468 transitions.
[2018-01-28 21:34:49,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-28 21:34:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 468 transitions.
[2018-01-28 21:34:49,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-01-28 21:34:49,009 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:34:49,009 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:34:49,009 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:34:49,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1650110101, now seen corresponding path program 1 times
[2018-01-28 21:34:49,010 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:34:49,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:34:49,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:49,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:49,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:49,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:34:49,134 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-28 21:34:49,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 21:34:49,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-28 21:34:49,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-28 21:34:49,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-28 21:34:49,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-28 21:34:49,136 INFO L87 Difference]: Start difference. First operand 363 states and 468 transitions. Second operand 4 states.
[2018-01-28 21:34:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:34:49,270 INFO L93 Difference]: Finished difference Result 495 states and 628 transitions.
[2018-01-28 21:34:49,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-28 21:34:49,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32
[2018-01-28 21:34:49,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:34:49,275 INFO L225 Difference]: With dead ends: 495
[2018-01-28 21:34:49,275 INFO L226 Difference]: Without dead ends: 491
[2018-01-28 21:34:49,276 INFO L533 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-28 21:34:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states.
[2018-01-28 21:34:49,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 467.
[2018-01-28 21:34:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states.
[2018-01-28 21:34:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 602 transitions.
[2018-01-28 21:34:49,301 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 602 transitions. Word has length 32
[2018-01-28 21:34:49,302 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:34:49,302 INFO L432 AbstractCegarLoop]: Abstraction has 467 states and 602 transitions.
[2018-01-28 21:34:49,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-28 21:34:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 602 transitions.
[2018-01-28 21:34:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-01-28 21:34:49,303 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:34:49,303 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:34:49,303 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:34:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1650387220, now seen corresponding path program 1 times
[2018-01-28 21:34:49,304 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:34:49,304 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:34:49,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:49,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:49,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:49,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:34:49,388 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-28 21:34:49,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 21:34:49,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-28 21:34:49,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-28 21:34:49,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-28 21:34:49,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-01-28 21:34:49,389 INFO L87 Difference]: Start difference. First operand 467 states and 602 transitions. Second operand 6 states.
[2018-01-28 21:34:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:34:49,588 INFO L93 Difference]: Finished difference Result 1319 states and 1722 transitions.
[2018-01-28 21:34:49,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-01-28 21:34:49,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32
[2018-01-28 21:34:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:34:49,599 INFO L225 Difference]: With dead ends: 1319
[2018-01-28 21:34:49,599 INFO L226 Difference]: Without dead ends: 867
[2018-01-28 21:34:49,604 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-01-28 21:34:49,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states.
[2018-01-28 21:34:49,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 831.
[2018-01-28 21:34:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states.
[2018-01-28 21:34:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1067 transitions.
[2018-01-28 21:34:49,648 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1067 transitions. Word has length 32
[2018-01-28 21:34:49,648 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:34:49,648 INFO L432 AbstractCegarLoop]: Abstraction has 831 states and 1067 transitions.
[2018-01-28 21:34:49,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-28 21:34:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1067 transitions.
[2018-01-28 21:34:49,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2018-01-28 21:34:49,650 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:34:49,650 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:34:49,650 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:34:49,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2104755951, now seen corresponding path program 1 times
[2018-01-28 21:34:49,650 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:34:49,651 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:34:49,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:49,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:49,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:49,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:34:49,748 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-28 21:34:49,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 21:34:49,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-28 21:34:49,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-28 21:34:49,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-28 21:34:49,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-01-28 21:34:49,749 INFO L87 Difference]: Start difference. First operand 831 states and 1067 transitions. Second operand 6 states.
[2018-01-28 21:34:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:34:49,874 INFO L93 Difference]: Finished difference Result 2337 states and 3003 transitions.
[2018-01-28 21:34:49,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-01-28 21:34:49,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34
[2018-01-28 21:34:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:34:49,883 INFO L225 Difference]: With dead ends: 2337
[2018-01-28 21:34:49,883 INFO L226 Difference]: Without dead ends: 1521
[2018-01-28 21:34:49,887 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-01-28 21:34:49,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states.
[2018-01-28 21:34:49,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1481.
[2018-01-28 21:34:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states.
[2018-01-28 21:34:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 1849 transitions.
[2018-01-28 21:34:49,960 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 1849 transitions. Word has length 34
[2018-01-28 21:34:49,961 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:34:49,961 INFO L432 AbstractCegarLoop]: Abstraction has 1481 states and 1849 transitions.
[2018-01-28 21:34:49,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-28 21:34:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1849 transitions.
[2018-01-28 21:34:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-01-28 21:34:49,962 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:34:49,963 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:34:49,963 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:34:49,963 INFO L82 PathProgramCache]: Analyzing trace with hash -571407759, now seen corresponding path program 1 times
[2018-01-28 21:34:49,963 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:34:49,963 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:34:49,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:49,964 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:49,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:49,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:34:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 21:34:50,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 21:34:50,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-28 21:34:50,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-28 21:34:50,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-28 21:34:50,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2018-01-28 21:34:50,083 INFO L87 Difference]: Start difference. First operand 1481 states and 1849 transitions. Second operand 6 states.
[2018-01-28 21:34:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:34:50,326 INFO L93 Difference]: Finished difference Result 3447 states and 4346 transitions.
[2018-01-28 21:34:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-28 21:34:50,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47
[2018-01-28 21:34:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:34:50,336 INFO L225 Difference]: With dead ends: 3447
[2018-01-28 21:34:50,337 INFO L226 Difference]: Without dead ends: 1981
[2018-01-28 21:34:50,341 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2018-01-28 21:34:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states.
[2018-01-28 21:34:50,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1903.
[2018-01-28 21:34:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states.
[2018-01-28 21:34:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2364 transitions.
[2018-01-28 21:34:50,444 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2364 transitions. Word has length 47
[2018-01-28 21:34:50,444 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:34:50,445 INFO L432 AbstractCegarLoop]: Abstraction has 1903 states and 2364 transitions.
[2018-01-28 21:34:50,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-28 21:34:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2364 transitions.
[2018-01-28 21:34:50,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2018-01-28 21:34:50,446 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:34:50,447 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:34:50,447 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:34:50,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1689985345, now seen corresponding path program 1 times
[2018-01-28 21:34:50,447 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:34:50,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:34:50,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:50,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:50,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:50,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:34:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 21:34:50,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:34:50,633 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:34:50,645 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:50,715 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:34:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 21:34:50,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:34:50,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8
[2018-01-28 21:34:50,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-28 21:34:50,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-28 21:34:50,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2018-01-28 21:34:50,828 INFO L87 Difference]: Start difference. First operand 1903 states and 2364 transitions. Second operand 8 states.
[2018-01-28 21:34:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:34:51,187 INFO L93 Difference]: Finished difference Result 4809 states and 6012 transitions.
[2018-01-28 21:34:51,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-01-28 21:34:51,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51
[2018-01-28 21:34:51,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:34:51,204 INFO L225 Difference]: With dead ends: 4809
[2018-01-28 21:34:51,204 INFO L226 Difference]: Without dead ends: 2921
[2018-01-28 21:34:51,211 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240
[2018-01-28 21:34:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states.
[2018-01-28 21:34:51,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2767.
[2018-01-28 21:34:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2767 states.
[2018-01-28 21:34:51,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2767 states and 3414 transitions.
[2018-01-28 21:34:51,347 INFO L78 Accepts]: Start accepts. Automaton has 2767 states and 3414 transitions. Word has length 51
[2018-01-28 21:34:51,348 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:34:51,348 INFO L432 AbstractCegarLoop]: Abstraction has 2767 states and 3414 transitions.
[2018-01-28 21:34:51,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-28 21:34:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2767 states and 3414 transitions.
[2018-01-28 21:34:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2018-01-28 21:34:51,350 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:34:51,350 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:34:51,350 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:34:51,350 INFO L82 PathProgramCache]: Analyzing trace with hash 388728054, now seen corresponding path program 1 times
[2018-01-28 21:34:51,350 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:34:51,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:34:51,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:51,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:51,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:51,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:34:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 21:34:51,622 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:34:51,622 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:34:51,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:51,693 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:34:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 21:34:51,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-28 21:34:51,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14
[2018-01-28 21:34:51,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-01-28 21:34:51,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-01-28 21:34:51,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2018-01-28 21:34:51,868 INFO L87 Difference]: Start difference. First operand 2767 states and 3414 transitions. Second operand 14 states.
[2018-01-28 21:34:53,125 WARN L146 SmtUtils]: Spent 261ms on a formula simplification. DAG size of input: 27 DAG size of output 22
[2018-01-28 21:34:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:34:53,833 INFO L93 Difference]: Finished difference Result 4494 states and 5487 transitions.
[2018-01-28 21:34:53,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-01-28 21:34:53,833 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60
[2018-01-28 21:34:53,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:34:53,841 INFO L225 Difference]: With dead ends: 4494
[2018-01-28 21:34:53,841 INFO L226 Difference]: Without dead ends: 1598
[2018-01-28 21:34:53,849 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056
[2018-01-28 21:34:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states.
[2018-01-28 21:34:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1486.
[2018-01-28 21:34:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states.
[2018-01-28 21:34:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1808 transitions.
[2018-01-28 21:34:53,919 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1808 transitions. Word has length 60
[2018-01-28 21:34:53,919 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:34:53,919 INFO L432 AbstractCegarLoop]: Abstraction has 1486 states and 1808 transitions.
[2018-01-28 21:34:53,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-01-28 21:34:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1808 transitions.
[2018-01-28 21:34:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2018-01-28 21:34:53,921 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:34:53,921 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:34:53,921 INFO L371 AbstractCegarLoop]: === Iteration 12 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:34:53,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2073582792, now seen corresponding path program 1 times
[2018-01-28 21:34:53,922 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:34:53,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:34:53,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:53,923 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:53,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:53,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:34:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 21:34:54,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:34:54,162 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:34:54,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:54,220 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:34:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 21:34:54,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:34:54,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16
[2018-01-28 21:34:54,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-01-28 21:34:54,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-01-28 21:34:54,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240
[2018-01-28 21:34:54,398 INFO L87 Difference]: Start difference. First operand 1486 states and 1808 transitions. Second operand 16 states.
[2018-01-28 21:34:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:34:55,756 INFO L93 Difference]: Finished difference Result 4820 states and 5973 transitions.
[2018-01-28 21:34:55,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2018-01-28 21:34:55,757 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60
[2018-01-28 21:34:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:34:55,774 INFO L225 Difference]: With dead ends: 4820
[2018-01-28 21:34:55,774 INFO L226 Difference]: Without dead ends: 3349
[2018-01-28 21:34:55,780 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=385, Invalid=1595, Unknown=0, NotChecked=0, Total=1980
[2018-01-28 21:34:55,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states.
[2018-01-28 21:34:55,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 2580.
[2018-01-28 21:34:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states.
[2018-01-28 21:34:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 3129 transitions.
[2018-01-28 21:34:55,898 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 3129 transitions. Word has length 60
[2018-01-28 21:34:55,898 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:34:55,898 INFO L432 AbstractCegarLoop]: Abstraction has 2580 states and 3129 transitions.
[2018-01-28 21:34:55,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-01-28 21:34:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3129 transitions.
[2018-01-28 21:34:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2018-01-28 21:34:55,900 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:34:55,901 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:34:55,901 INFO L371 AbstractCegarLoop]: === Iteration 13 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:34:55,901 INFO L82 PathProgramCache]: Analyzing trace with hash -282283255, now seen corresponding path program 1 times
[2018-01-28 21:34:55,901 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:34:55,901 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:34:55,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:55,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:55,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:55,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:34:56,075 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 21:34:56,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:34:56,076 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:34:56,084 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:56,145 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:34:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2018-01-28 21:34:56,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-28 21:34:56,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12
[2018-01-28 21:34:56,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-01-28 21:34:56,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-01-28 21:34:56,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2018-01-28 21:34:56,291 INFO L87 Difference]: Start difference. First operand 2580 states and 3129 transitions. Second operand 12 states.
[2018-01-28 21:34:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:34:57,532 INFO L93 Difference]: Finished difference Result 9491 states and 11650 transitions.
[2018-01-28 21:34:57,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states.
[2018-01-28 21:34:57,532 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70
[2018-01-28 21:34:57,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:34:57,567 INFO L225 Difference]: With dead ends: 9491
[2018-01-28 21:34:57,567 INFO L226 Difference]: Without dead ends: 6926
[2018-01-28 21:34:57,576 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=440, Invalid=1816, Unknown=0, NotChecked=0, Total=2256
[2018-01-28 21:34:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6926 states.
[2018-01-28 21:34:57,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6926 to 6132.
[2018-01-28 21:34:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6132 states.
[2018-01-28 21:34:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6132 states to 6132 states and 7432 transitions.
[2018-01-28 21:34:57,869 INFO L78 Accepts]: Start accepts. Automaton has 6132 states and 7432 transitions. Word has length 70
[2018-01-28 21:34:57,870 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:34:57,870 INFO L432 AbstractCegarLoop]: Abstraction has 6132 states and 7432 transitions.
[2018-01-28 21:34:57,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-01-28 21:34:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 6132 states and 7432 transitions.
[2018-01-28 21:34:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2018-01-28 21:34:57,872 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:34:57,872 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:34:57,872 INFO L371 AbstractCegarLoop]: === Iteration 14 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:34:57,872 INFO L82 PathProgramCache]: Analyzing trace with hash -178621021, now seen corresponding path program 1 times
[2018-01-28 21:34:57,873 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:34:57,873 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:34:57,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:57,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:57,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:57,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:34:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 21:34:58,028 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:34:58,028 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:34:58,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:58,089 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:34:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 21:34:58,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:34:58,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13
[2018-01-28 21:34:58,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-01-28 21:34:58,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-01-28 21:34:58,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156
[2018-01-28 21:34:58,227 INFO L87 Difference]: Start difference. First operand 6132 states and 7432 transitions. Second operand 13 states.
[2018-01-28 21:34:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:34:58,634 INFO L93 Difference]: Finished difference Result 11638 states and 14076 transitions.
[2018-01-28 21:34:58,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-01-28 21:34:58,665 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76
[2018-01-28 21:34:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:34:58,685 INFO L225 Difference]: With dead ends: 11638
[2018-01-28 21:34:58,685 INFO L226 Difference]: Without dead ends: 6246
[2018-01-28 21:34:58,696 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552
[2018-01-28 21:34:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states.
[2018-01-28 21:34:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 6054.
[2018-01-28 21:34:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6054 states.
[2018-01-28 21:34:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6054 states to 6054 states and 7328 transitions.
[2018-01-28 21:34:58,843 INFO L78 Accepts]: Start accepts. Automaton has 6054 states and 7328 transitions. Word has length 76
[2018-01-28 21:34:58,844 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:34:58,844 INFO L432 AbstractCegarLoop]: Abstraction has 6054 states and 7328 transitions.
[2018-01-28 21:34:58,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-01-28 21:34:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 6054 states and 7328 transitions.
[2018-01-28 21:34:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2018-01-28 21:34:58,845 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:34:58,845 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:34:58,845 INFO L371 AbstractCegarLoop]: === Iteration 15 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:34:58,846 INFO L82 PathProgramCache]: Analyzing trace with hash 860849516, now seen corresponding path program 1 times
[2018-01-28 21:34:58,846 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:34:58,846 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:34:58,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:58,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:58,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:34:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:58,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:34:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 21:34:58,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:34:58,972 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:34:58,977 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:34:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:34:59,012 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:34:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 21:34:59,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:34:59,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13
[2018-01-28 21:34:59,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-01-28 21:34:59,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-01-28 21:34:59,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156
[2018-01-28 21:34:59,073 INFO L87 Difference]: Start difference. First operand 6054 states and 7328 transitions. Second operand 13 states.
[2018-01-28 21:34:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:34:59,754 INFO L93 Difference]: Finished difference Result 13463 states and 16947 transitions.
[2018-01-28 21:34:59,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-01-28 21:34:59,754 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77
[2018-01-28 21:34:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:34:59,787 INFO L225 Difference]: With dead ends: 13463
[2018-01-28 21:34:59,788 INFO L226 Difference]: Without dead ends: 8227
[2018-01-28 21:34:59,802 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812
[2018-01-28 21:34:59,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8227 states.
[2018-01-28 21:35:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8227 to 5190.
[2018-01-28 21:35:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5190 states.
[2018-01-28 21:35:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 6254 transitions.
[2018-01-28 21:35:00,049 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 6254 transitions. Word has length 77
[2018-01-28 21:35:00,049 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:00,050 INFO L432 AbstractCegarLoop]: Abstraction has 5190 states and 6254 transitions.
[2018-01-28 21:35:00,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-01-28 21:35:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 6254 transitions.
[2018-01-28 21:35:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2018-01-28 21:35:00,052 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:00,053 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:35:00,053 INFO L371 AbstractCegarLoop]: === Iteration 16 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:00,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1860818894, now seen corresponding path program 1 times
[2018-01-28 21:35:00,053 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:00,053 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:00,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:00,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:00,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:00,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-01-28 21:35:00,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:35:00,217 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:35:00,227 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:00,274 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:35:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-01-28 21:35:00,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:35:00,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14
[2018-01-28 21:35:00,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-01-28 21:35:00,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-01-28 21:35:00,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182
[2018-01-28 21:35:00,371 INFO L87 Difference]: Start difference. First operand 5190 states and 6254 transitions. Second operand 14 states.
[2018-01-28 21:35:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:00,782 INFO L93 Difference]: Finished difference Result 10676 states and 12938 transitions.
[2018-01-28 21:35:00,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-01-28 21:35:00,782 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95
[2018-01-28 21:35:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:00,801 INFO L225 Difference]: With dead ends: 10676
[2018-01-28 21:35:00,801 INFO L226 Difference]: Without dead ends: 6304
[2018-01-28 21:35:00,809 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650
[2018-01-28 21:35:00,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states.
[2018-01-28 21:35:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 6132.
[2018-01-28 21:35:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6132 states.
[2018-01-28 21:35:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6132 states to 6132 states and 7466 transitions.
[2018-01-28 21:35:00,976 INFO L78 Accepts]: Start accepts. Automaton has 6132 states and 7466 transitions. Word has length 95
[2018-01-28 21:35:00,976 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:00,976 INFO L432 AbstractCegarLoop]: Abstraction has 6132 states and 7466 transitions.
[2018-01-28 21:35:00,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-01-28 21:35:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 6132 states and 7466 transitions.
[2018-01-28 21:35:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2018-01-28 21:35:00,979 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:00,979 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:35:00,979 INFO L371 AbstractCegarLoop]: === Iteration 17 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:00,979 INFO L82 PathProgramCache]: Analyzing trace with hash 541278865, now seen corresponding path program 1 times
[2018-01-28 21:35:00,979 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:00,979 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:00,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:00,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:00,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:00,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 42 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-01-28 21:35:01,151 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:35:01,151 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:35:01,156 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:01,203 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:35:01,249 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-01-28 21:35:01,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:35:01,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13
[2018-01-28 21:35:01,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-01-28 21:35:01,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-01-28 21:35:01,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156
[2018-01-28 21:35:01,271 INFO L87 Difference]: Start difference. First operand 6132 states and 7466 transitions. Second operand 13 states.
[2018-01-28 21:35:01,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:01,771 INFO L93 Difference]: Finished difference Result 11566 states and 14072 transitions.
[2018-01-28 21:35:01,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-01-28 21:35:01,772 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97
[2018-01-28 21:35:01,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:01,789 INFO L225 Difference]: With dead ends: 11566
[2018-01-28 21:35:01,790 INFO L226 Difference]: Without dead ends: 6002
[2018-01-28 21:35:01,805 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600
[2018-01-28 21:35:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states.
[2018-01-28 21:35:02,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 5934.
[2018-01-28 21:35:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5934 states.
[2018-01-28 21:35:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5934 states to 5934 states and 7164 transitions.
[2018-01-28 21:35:02,059 INFO L78 Accepts]: Start accepts. Automaton has 5934 states and 7164 transitions. Word has length 97
[2018-01-28 21:35:02,059 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:02,059 INFO L432 AbstractCegarLoop]: Abstraction has 5934 states and 7164 transitions.
[2018-01-28 21:35:02,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-01-28 21:35:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 5934 states and 7164 transitions.
[2018-01-28 21:35:02,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2018-01-28 21:35:02,062 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:02,063 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:35:02,063 INFO L371 AbstractCegarLoop]: === Iteration 18 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:02,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2070725107, now seen corresponding path program 1 times
[2018-01-28 21:35:02,063 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:02,063 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:02,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:02,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:02,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:02,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-01-28 21:35:02,206 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:35:02,206 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:35:02,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:02,281 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:35:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2018-01-28 21:35:02,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:35:02,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11
[2018-01-28 21:35:02,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-01-28 21:35:02,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-01-28 21:35:02,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2018-01-28 21:35:02,363 INFO L87 Difference]: Start difference. First operand 5934 states and 7164 transitions. Second operand 11 states.
[2018-01-28 21:35:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:03,249 INFO L93 Difference]: Finished difference Result 15340 states and 19444 transitions.
[2018-01-28 21:35:03,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-01-28 21:35:03,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100
[2018-01-28 21:35:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:03,281 INFO L225 Difference]: With dead ends: 15340
[2018-01-28 21:35:03,282 INFO L226 Difference]: Without dead ends: 9271
[2018-01-28 21:35:03,301 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552
[2018-01-28 21:35:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9271 states.
[2018-01-28 21:35:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9271 to 6970.
[2018-01-28 21:35:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6970 states.
[2018-01-28 21:35:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6970 states to 6970 states and 8340 transitions.
[2018-01-28 21:35:03,691 INFO L78 Accepts]: Start accepts. Automaton has 6970 states and 8340 transitions. Word has length 100
[2018-01-28 21:35:03,692 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:03,692 INFO L432 AbstractCegarLoop]: Abstraction has 6970 states and 8340 transitions.
[2018-01-28 21:35:03,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-01-28 21:35:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 6970 states and 8340 transitions.
[2018-01-28 21:35:03,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2018-01-28 21:35:03,695 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:03,695 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:35:03,695 INFO L371 AbstractCegarLoop]: === Iteration 19 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:03,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1941483643, now seen corresponding path program 1 times
[2018-01-28 21:35:03,696 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:03,696 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:03,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:03,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:03,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:03,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-01-28 21:35:03,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:35:03,946 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:35:03,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:04,046 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:35:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 38 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-01-28 21:35:04,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:35:04,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21
[2018-01-28 21:35:04,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-01-28 21:35:04,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-01-28 21:35:04,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420
[2018-01-28 21:35:04,285 INFO L87 Difference]: Start difference. First operand 6970 states and 8340 transitions. Second operand 21 states.
[2018-01-28 21:35:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:05,647 INFO L93 Difference]: Finished difference Result 16310 states and 19818 transitions.
[2018-01-28 21:35:05,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2018-01-28 21:35:05,648 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 104
[2018-01-28 21:35:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:05,678 INFO L225 Difference]: With dead ends: 16310
[2018-01-28 21:35:05,678 INFO L226 Difference]: Without dead ends: 10242
[2018-01-28 21:35:05,692 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352
[2018-01-28 21:35:05,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states.
[2018-01-28 21:35:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 8714.
[2018-01-28 21:35:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8714 states.
[2018-01-28 21:35:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8714 states to 8714 states and 10346 transitions.
[2018-01-28 21:35:06,084 INFO L78 Accepts]: Start accepts. Automaton has 8714 states and 10346 transitions. Word has length 104
[2018-01-28 21:35:06,084 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:06,084 INFO L432 AbstractCegarLoop]: Abstraction has 8714 states and 10346 transitions.
[2018-01-28 21:35:06,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-01-28 21:35:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 8714 states and 10346 transitions.
[2018-01-28 21:35:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2018-01-28 21:35:06,087 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:06,087 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:35:06,087 INFO L371 AbstractCegarLoop]: === Iteration 20 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:06,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1714577854, now seen corresponding path program 2 times
[2018-01-28 21:35:06,088 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:06,088 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:06,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:06,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:06,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:06,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 78 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-01-28 21:35:06,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:35:06,255 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:35:06,263 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-28 21:35:06,308 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-28 21:35:06,333 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-28 21:35:06,338 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-28 21:35:06,342 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:35:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 88 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2018-01-28 21:35:06,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:35:06,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12
[2018-01-28 21:35:06,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-01-28 21:35:06,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-01-28 21:35:06,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2018-01-28 21:35:06,393 INFO L87 Difference]: Start difference. First operand 8714 states and 10346 transitions. Second operand 12 states.
[2018-01-28 21:35:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:06,995 INFO L93 Difference]: Finished difference Result 14736 states and 18066 transitions.
[2018-01-28 21:35:06,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-01-28 21:35:06,996 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109
[2018-01-28 21:35:06,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:07,006 INFO L225 Difference]: With dead ends: 14736
[2018-01-28 21:35:07,006 INFO L226 Difference]: Without dead ends: 5989
[2018-01-28 21:35:07,015 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552
[2018-01-28 21:35:07,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states.
[2018-01-28 21:35:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 4466.
[2018-01-28 21:35:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4466 states.
[2018-01-28 21:35:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 5250 transitions.
[2018-01-28 21:35:07,185 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 5250 transitions. Word has length 109
[2018-01-28 21:35:07,185 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:07,185 INFO L432 AbstractCegarLoop]: Abstraction has 4466 states and 5250 transitions.
[2018-01-28 21:35:07,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-01-28 21:35:07,185 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 5250 transitions.
[2018-01-28 21:35:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2018-01-28 21:35:07,188 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:07,188 INFO L330 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:35:07,188 INFO L371 AbstractCegarLoop]: === Iteration 21 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:07,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1206879794, now seen corresponding path program 1 times
[2018-01-28 21:35:07,188 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:07,188 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:07,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:07,189 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-28 21:35:07,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:07,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 114 proven. 27 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2018-01-28 21:35:07,462 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:35:07,462 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:35:07,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:07,549 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:35:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 148 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2018-01-28 21:35:07,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:35:07,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14
[2018-01-28 21:35:07,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-01-28 21:35:07,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-01-28 21:35:07,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182
[2018-01-28 21:35:07,885 INFO L87 Difference]: Start difference. First operand 4466 states and 5250 transitions. Second operand 14 states.
[2018-01-28 21:35:08,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:08,799 INFO L93 Difference]: Finished difference Result 10039 states and 11912 transitions.
[2018-01-28 21:35:08,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-01-28 21:35:08,831 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 137
[2018-01-28 21:35:08,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:08,838 INFO L225 Difference]: With dead ends: 10039
[2018-01-28 21:35:08,838 INFO L226 Difference]: Without dead ends: 5561
[2018-01-28 21:35:08,843 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992
[2018-01-28 21:35:08,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5561 states.
[2018-01-28 21:35:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5561 to 5369.
[2018-01-28 21:35:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5369 states.
[2018-01-28 21:35:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5369 states to 5369 states and 6333 transitions.
[2018-01-28 21:35:09,102 INFO L78 Accepts]: Start accepts. Automaton has 5369 states and 6333 transitions. Word has length 137
[2018-01-28 21:35:09,102 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:09,102 INFO L432 AbstractCegarLoop]: Abstraction has 5369 states and 6333 transitions.
[2018-01-28 21:35:09,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-01-28 21:35:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5369 states and 6333 transitions.
[2018-01-28 21:35:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140
[2018-01-28 21:35:09,106 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:09,107 INFO L330 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:35:09,107 INFO L371 AbstractCegarLoop]: === Iteration 22 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:09,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1460314129, now seen corresponding path program 1 times
[2018-01-28 21:35:09,107 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:09,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:09,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:09,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:09,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:09,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked.
[2018-01-28 21:35:09,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:35:09,288 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:35:09,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:09,360 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:35:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked.
[2018-01-28 21:35:09,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:35:09,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14
[2018-01-28 21:35:09,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-01-28 21:35:09,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-01-28 21:35:09,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182
[2018-01-28 21:35:09,469 INFO L87 Difference]: Start difference. First operand 5369 states and 6333 transitions. Second operand 14 states.
[2018-01-28 21:35:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:10,058 INFO L93 Difference]: Finished difference Result 12247 states and 14629 transitions.
[2018-01-28 21:35:10,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-01-28 21:35:10,059 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 139
[2018-01-28 21:35:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:10,068 INFO L225 Difference]: With dead ends: 12247
[2018-01-28 21:35:10,068 INFO L226 Difference]: Without dead ends: 6965
[2018-01-28 21:35:10,074 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650
[2018-01-28 21:35:10,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states.
[2018-01-28 21:35:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 5222.
[2018-01-28 21:35:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states.
[2018-01-28 21:35:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 6176 transitions.
[2018-01-28 21:35:10,275 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 6176 transitions. Word has length 139
[2018-01-28 21:35:10,275 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:10,275 INFO L432 AbstractCegarLoop]: Abstraction has 5222 states and 6176 transitions.
[2018-01-28 21:35:10,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-01-28 21:35:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 6176 transitions.
[2018-01-28 21:35:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2018-01-28 21:35:10,277 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:10,277 INFO L330 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:35:10,278 INFO L371 AbstractCegarLoop]: === Iteration 23 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:10,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1639651694, now seen corresponding path program 1 times
[2018-01-28 21:35:10,278 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:10,278 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:10,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:10,278 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:10,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:10,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 66 proven. 84 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked.
[2018-01-28 21:35:10,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:35:10,490 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:35:10,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:10,582 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:35:10,691 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 152 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2018-01-28 21:35:10,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:35:10,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18
[2018-01-28 21:35:10,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-01-28 21:35:10,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-01-28 21:35:10,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306
[2018-01-28 21:35:10,713 INFO L87 Difference]: Start difference. First operand 5222 states and 6176 transitions. Second operand 18 states.
[2018-01-28 21:35:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:12,594 INFO L93 Difference]: Finished difference Result 16641 states and 19954 transitions.
[2018-01-28 21:35:12,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states.
[2018-01-28 21:35:12,595 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142
[2018-01-28 21:35:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:12,611 INFO L225 Difference]: With dead ends: 16641
[2018-01-28 21:35:12,611 INFO L226 Difference]: Without dead ends: 11551
[2018-01-28 21:35:12,617 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=807, Invalid=4305, Unknown=0, NotChecked=0, Total=5112
[2018-01-28 21:35:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11551 states.
[2018-01-28 21:35:12,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11551 to 10320.
[2018-01-28 21:35:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10320 states.
[2018-01-28 21:35:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10320 states to 10320 states and 12333 transitions.
[2018-01-28 21:35:13,003 INFO L78 Accepts]: Start accepts. Automaton has 10320 states and 12333 transitions. Word has length 142
[2018-01-28 21:35:13,003 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:13,003 INFO L432 AbstractCegarLoop]: Abstraction has 10320 states and 12333 transitions.
[2018-01-28 21:35:13,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-01-28 21:35:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 10320 states and 12333 transitions.
[2018-01-28 21:35:13,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2018-01-28 21:35:13,006 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:13,006 INFO L330 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:35:13,006 INFO L371 AbstractCegarLoop]: === Iteration 24 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:13,007 INFO L82 PathProgramCache]: Analyzing trace with hash -699019322, now seen corresponding path program 1 times
[2018-01-28 21:35:13,007 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:13,007 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:13,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:13,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:13,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:13,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 66 proven. 118 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2018-01-28 21:35:13,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:35:13,429 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:35:13,442 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:13,524 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:35:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked.
[2018-01-28 21:35:14,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:35:14,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20
[2018-01-28 21:35:14,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-01-28 21:35:14,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-01-28 21:35:14,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380
[2018-01-28 21:35:14,145 INFO L87 Difference]: Start difference. First operand 10320 states and 12333 transitions. Second operand 20 states.
[2018-01-28 21:35:19,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:19,426 INFO L93 Difference]: Finished difference Result 31774 states and 38391 transitions.
[2018-01-28 21:35:19,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states.
[2018-01-28 21:35:19,427 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 160
[2018-01-28 21:35:19,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:19,456 INFO L225 Difference]: With dead ends: 31774
[2018-01-28 21:35:19,457 INFO L226 Difference]: Without dead ends: 21586
[2018-01-28 21:35:19,473 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6484 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2281, Invalid=15809, Unknown=0, NotChecked=0, Total=18090
[2018-01-28 21:35:19,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21586 states.
[2018-01-28 21:35:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21586 to 20969.
[2018-01-28 21:35:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20969 states.
[2018-01-28 21:35:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 25238 transitions.
[2018-01-28 21:35:20,324 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 25238 transitions. Word has length 160
[2018-01-28 21:35:20,324 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:20,324 INFO L432 AbstractCegarLoop]: Abstraction has 20969 states and 25238 transitions.
[2018-01-28 21:35:20,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-01-28 21:35:20,324 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 25238 transitions.
[2018-01-28 21:35:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2018-01-28 21:35:20,329 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:20,329 INFO L330 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:35:20,329 INFO L371 AbstractCegarLoop]: === Iteration 25 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:20,329 INFO L82 PathProgramCache]: Analyzing trace with hash 122404954, now seen corresponding path program 1 times
[2018-01-28 21:35:20,330 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:20,330 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:20,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:20,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:20,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:20,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 162 proven. 12 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked.
[2018-01-28 21:35:20,704 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:35:20,704 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:35:20,709 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:20,772 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:35:20,883 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 156 proven. 34 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2018-01-28 21:35:20,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:35:20,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22
[2018-01-28 21:35:20,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-01-28 21:35:20,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-01-28 21:35:20,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462
[2018-01-28 21:35:20,904 INFO L87 Difference]: Start difference. First operand 20969 states and 25238 transitions. Second operand 22 states.
[2018-01-28 21:35:22,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:22,923 INFO L93 Difference]: Finished difference Result 49022 states and 59150 transitions.
[2018-01-28 21:35:22,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2018-01-28 21:35:22,924 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 165
[2018-01-28 21:35:22,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:22,991 INFO L225 Difference]: With dead ends: 49022
[2018-01-28 21:35:22,991 INFO L226 Difference]: Without dead ends: 28262
[2018-01-28 21:35:23,020 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=479, Invalid=1971, Unknown=0, NotChecked=0, Total=2450
[2018-01-28 21:35:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28262 states.
[2018-01-28 21:35:24,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28262 to 22589.
[2018-01-28 21:35:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22589 states.
[2018-01-28 21:35:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22589 states to 22589 states and 26568 transitions.
[2018-01-28 21:35:24,078 INFO L78 Accepts]: Start accepts. Automaton has 22589 states and 26568 transitions. Word has length 165
[2018-01-28 21:35:24,079 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:24,079 INFO L432 AbstractCegarLoop]: Abstraction has 22589 states and 26568 transitions.
[2018-01-28 21:35:24,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-01-28 21:35:24,079 INFO L276 IsEmpty]: Start isEmpty. Operand 22589 states and 26568 transitions.
[2018-01-28 21:35:24,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2018-01-28 21:35:24,082 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:24,082 INFO L330 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:35:24,082 INFO L371 AbstractCegarLoop]: === Iteration 26 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:24,082 INFO L82 PathProgramCache]: Analyzing trace with hash -194336044, now seen corresponding path program 1 times
[2018-01-28 21:35:24,083 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:24,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:24,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:24,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:24,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:24,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 144 proven. 34 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked.
[2018-01-28 21:35:24,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:35:24,421 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:35:24,426 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:24,483 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:35:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 158 proven. 28 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2018-01-28 21:35:24,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:35:24,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21
[2018-01-28 21:35:24,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-01-28 21:35:24,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-01-28 21:35:24,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420
[2018-01-28 21:35:24,603 INFO L87 Difference]: Start difference. First operand 22589 states and 26568 transitions. Second operand 21 states.
[2018-01-28 21:35:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:26,469 INFO L93 Difference]: Finished difference Result 47310 states and 55639 transitions.
[2018-01-28 21:35:26,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2018-01-28 21:35:26,470 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 169
[2018-01-28 21:35:26,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:26,508 INFO L225 Difference]: With dead ends: 47310
[2018-01-28 21:35:26,509 INFO L226 Difference]: Without dead ends: 24586
[2018-01-28 21:35:26,533 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=463, Invalid=1889, Unknown=0, NotChecked=0, Total=2352
[2018-01-28 21:35:26,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24586 states.
[2018-01-28 21:35:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24586 to 24391.
[2018-01-28 21:35:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24391 states.
[2018-01-28 21:35:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24391 states to 24391 states and 28419 transitions.
[2018-01-28 21:35:27,585 INFO L78 Accepts]: Start accepts. Automaton has 24391 states and 28419 transitions. Word has length 169
[2018-01-28 21:35:27,585 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:27,585 INFO L432 AbstractCegarLoop]: Abstraction has 24391 states and 28419 transitions.
[2018-01-28 21:35:27,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-01-28 21:35:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 24391 states and 28419 transitions.
[2018-01-28 21:35:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182
[2018-01-28 21:35:27,588 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:27,588 INFO L330 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:35:27,588 INFO L371 AbstractCegarLoop]: === Iteration 27 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:27,589 INFO L82 PathProgramCache]: Analyzing trace with hash -315863401, now seen corresponding path program 1 times
[2018-01-28 21:35:27,589 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:27,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:27,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:27,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:27,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:27,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 80 proven. 146 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked.
[2018-01-28 21:35:27,915 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:35:27,915 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:35:28,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:28,072 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:35:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 86 proven. 140 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked.
[2018-01-28 21:35:28,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:35:28,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19
[2018-01-28 21:35:28,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-01-28 21:35:28,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-01-28 21:35:28,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380
[2018-01-28 21:35:28,458 INFO L87 Difference]: Start difference. First operand 24391 states and 28419 transitions. Second operand 20 states.
[2018-01-28 21:35:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:32,191 INFO L93 Difference]: Finished difference Result 35017 states and 40933 transitions.
[2018-01-28 21:35:32,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states.
[2018-01-28 21:35:32,192 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 181
[2018-01-28 21:35:32,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:32,243 INFO L225 Difference]: With dead ends: 35017
[2018-01-28 21:35:32,243 INFO L226 Difference]: Without dead ends: 35014
[2018-01-28 21:35:32,253 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 185 SyntacticMatches, 10 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=530, Invalid=2226, Unknown=0, NotChecked=0, Total=2756
[2018-01-28 21:35:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35014 states.
[2018-01-28 21:35:33,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35014 to 34483.
[2018-01-28 21:35:33,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34483 states.
[2018-01-28 21:35:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34483 states to 34483 states and 40107 transitions.
[2018-01-28 21:35:33,813 INFO L78 Accepts]: Start accepts. Automaton has 34483 states and 40107 transitions. Word has length 181
[2018-01-28 21:35:33,814 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:33,814 INFO L432 AbstractCegarLoop]: Abstraction has 34483 states and 40107 transitions.
[2018-01-28 21:35:33,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-01-28 21:35:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 34483 states and 40107 transitions.
[2018-01-28 21:35:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2018-01-28 21:35:33,819 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:33,819 INFO L330 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:35:33,819 INFO L371 AbstractCegarLoop]: === Iteration 28 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:33,819 INFO L82 PathProgramCache]: Analyzing trace with hash 236158871, now seen corresponding path program 1 times
[2018-01-28 21:35:33,819 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:33,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:33,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:33,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:33,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:33,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked.
[2018-01-28 21:35:33,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 21:35:33,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-01-28 21:35:33,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-28 21:35:33,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-28 21:35:33,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2018-01-28 21:35:33,946 INFO L87 Difference]: Start difference. First operand 34483 states and 40107 transitions. Second operand 7 states.
[2018-01-28 21:35:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:35,627 INFO L93 Difference]: Finished difference Result 70151 states and 82160 transitions.
[2018-01-28 21:35:35,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-01-28 21:35:35,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225
[2018-01-28 21:35:35,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:35,680 INFO L225 Difference]: With dead ends: 70151
[2018-01-28 21:35:35,681 INFO L226 Difference]: Without dead ends: 37696
[2018-01-28 21:35:35,705 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2018-01-28 21:35:35,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37696 states.
[2018-01-28 21:35:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37696 to 37261.
[2018-01-28 21:35:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37261 states.
[2018-01-28 21:35:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37261 states to 37261 states and 43239 transitions.
[2018-01-28 21:35:37,306 INFO L78 Accepts]: Start accepts. Automaton has 37261 states and 43239 transitions. Word has length 225
[2018-01-28 21:35:37,306 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:37,306 INFO L432 AbstractCegarLoop]: Abstraction has 37261 states and 43239 transitions.
[2018-01-28 21:35:37,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-28 21:35:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 37261 states and 43239 transitions.
[2018-01-28 21:35:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245
[2018-01-28 21:35:37,313 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:37,314 INFO L330 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:35:37,314 INFO L371 AbstractCegarLoop]: === Iteration 29 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:37,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1551282745, now seen corresponding path program 2 times
[2018-01-28 21:35:37,314 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:37,314 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:37,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:37,315 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:37,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:37,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked.
[2018-01-28 21:35:37,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 21:35:37,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-01-28 21:35:37,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-28 21:35:37,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-28 21:35:37,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2018-01-28 21:35:37,568 INFO L87 Difference]: Start difference. First operand 37261 states and 43239 transitions. Second operand 7 states.
[2018-01-28 21:35:39,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:39,224 INFO L93 Difference]: Finished difference Result 74763 states and 87354 transitions.
[2018-01-28 21:35:39,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-01-28 21:35:39,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 244
[2018-01-28 21:35:39,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:39,293 INFO L225 Difference]: With dead ends: 74763
[2018-01-28 21:35:39,293 INFO L226 Difference]: Without dead ends: 39530
[2018-01-28 21:35:39,333 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2018-01-28 21:35:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39530 states.
[2018-01-28 21:35:41,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39530 to 37243.
[2018-01-28 21:35:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37243 states.
[2018-01-28 21:35:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37243 states to 37243 states and 43209 transitions.
[2018-01-28 21:35:41,063 INFO L78 Accepts]: Start accepts. Automaton has 37243 states and 43209 transitions. Word has length 244
[2018-01-28 21:35:41,064 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:41,064 INFO L432 AbstractCegarLoop]: Abstraction has 37243 states and 43209 transitions.
[2018-01-28 21:35:41,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-28 21:35:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 37243 states and 43209 transitions.
[2018-01-28 21:35:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246
[2018-01-28 21:35:41,072 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:41,073 INFO L330 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 21:35:41,073 INFO L371 AbstractCegarLoop]: === Iteration 30 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:41,073 INFO L82 PathProgramCache]: Analyzing trace with hash -966030029, now seen corresponding path program 1 times
[2018-01-28 21:35:41,073 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:41,073 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:41,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:41,074 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-28 21:35:41,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:41,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 144 proven. 304 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked.
[2018-01-28 21:35:41,323 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:35:41,323 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:35:41,329 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:41,408 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:35:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 219 proven. 6 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked.
[2018-01-28 21:35:41,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:35:41,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21
[2018-01-28 21:35:41,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-01-28 21:35:41,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-01-28 21:35:41,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420
[2018-01-28 21:35:41,547 INFO L87 Difference]: Start difference. First operand 37243 states and 43209 transitions. Second operand 21 states.
[2018-01-28 21:35:52,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:52,960 INFO L93 Difference]: Finished difference Result 88602 states and 106407 transitions.
[2018-01-28 21:35:52,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states.
[2018-01-28 21:35:52,960 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 245
[2018-01-28 21:35:52,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:53,049 INFO L225 Difference]: With dead ends: 88602
[2018-01-28 21:35:53,049 INFO L226 Difference]: Without dead ends: 52649
[2018-01-28 21:35:53,089 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31289 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6022, Invalid=67690, Unknown=0, NotChecked=0, Total=73712
[2018-01-28 21:35:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52649 states.
[2018-01-28 21:35:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52649 to 48307.
[2018-01-28 21:35:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48307 states.
[2018-01-28 21:35:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48307 states to 48307 states and 58135 transitions.
[2018-01-28 21:35:55,849 INFO L78 Accepts]: Start accepts. Automaton has 48307 states and 58135 transitions. Word has length 245
[2018-01-28 21:35:55,849 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:35:55,849 INFO L432 AbstractCegarLoop]: Abstraction has 48307 states and 58135 transitions.
[2018-01-28 21:35:55,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-01-28 21:35:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 48307 states and 58135 transitions.
[2018-01-28 21:35:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273
[2018-01-28 21:35:55,864 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:35:55,864 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:35:55,864 INFO L371 AbstractCegarLoop]: === Iteration 31 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:35:55,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2081673946, now seen corresponding path program 1 times
[2018-01-28 21:35:55,864 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:35:55,864 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:35:55,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:55,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:55,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:35:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:55,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:35:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 178 proven. 11 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked.
[2018-01-28 21:35:56,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:35:56,042 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:35:56,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:35:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:35:56,135 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:35:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 178 proven. 11 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked.
[2018-01-28 21:35:56,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:35:56,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14
[2018-01-28 21:35:56,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-01-28 21:35:56,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-01-28 21:35:56,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182
[2018-01-28 21:35:56,225 INFO L87 Difference]: Start difference. First operand 48307 states and 58135 transitions. Second operand 14 states.
[2018-01-28 21:35:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:35:58,803 INFO L93 Difference]: Finished difference Result 81735 states and 99033 transitions.
[2018-01-28 21:35:58,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-01-28 21:35:58,803 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 272
[2018-01-28 21:35:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:35:58,878 INFO L225 Difference]: With dead ends: 81735
[2018-01-28 21:35:58,878 INFO L226 Difference]: Without dead ends: 37535
[2018-01-28 21:35:58,923 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 278 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056
[2018-01-28 21:35:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37535 states.
[2018-01-28 21:36:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37535 to 36588.
[2018-01-28 21:36:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36588 states.
[2018-01-28 21:36:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36588 states to 36588 states and 43772 transitions.
[2018-01-28 21:36:01,120 INFO L78 Accepts]: Start accepts. Automaton has 36588 states and 43772 transitions. Word has length 272
[2018-01-28 21:36:01,120 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:36:01,120 INFO L432 AbstractCegarLoop]: Abstraction has 36588 states and 43772 transitions.
[2018-01-28 21:36:01,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-01-28 21:36:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 36588 states and 43772 transitions.
[2018-01-28 21:36:01,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275
[2018-01-28 21:36:01,134 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:36:01,134 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:36:01,134 INFO L371 AbstractCegarLoop]: === Iteration 32 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:36:01,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1963442467, now seen corresponding path program 1 times
[2018-01-28 21:36:01,134 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:36:01,134 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:36:01,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:36:01,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:36:01,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:36:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:36:01,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:36:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 183 proven. 5 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked.
[2018-01-28 21:36:01,320 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:36:01,320 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:36:01,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:36:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:36:01,407 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:36:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 177 proven. 11 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked.
[2018-01-28 21:36:01,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:36:01,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14
[2018-01-28 21:36:01,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-01-28 21:36:01,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-01-28 21:36:01,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182
[2018-01-28 21:36:01,511 INFO L87 Difference]: Start difference. First operand 36588 states and 43772 transitions. Second operand 14 states.
[2018-01-28 21:36:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:36:04,112 INFO L93 Difference]: Finished difference Result 65926 states and 79647 transitions.
[2018-01-28 21:36:04,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-01-28 21:36:04,113 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 274
[2018-01-28 21:36:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:36:04,172 INFO L225 Difference]: With dead ends: 65926
[2018-01-28 21:36:04,172 INFO L226 Difference]: Without dead ends: 38187
[2018-01-28 21:36:04,203 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056
[2018-01-28 21:36:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38187 states.
[2018-01-28 21:36:05,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38187 to 32985.
[2018-01-28 21:36:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32985 states.
[2018-01-28 21:36:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32985 states to 32985 states and 39423 transitions.
[2018-01-28 21:36:06,009 INFO L78 Accepts]: Start accepts. Automaton has 32985 states and 39423 transitions. Word has length 274
[2018-01-28 21:36:06,009 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:36:06,009 INFO L432 AbstractCegarLoop]: Abstraction has 32985 states and 39423 transitions.
[2018-01-28 21:36:06,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-01-28 21:36:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 32985 states and 39423 transitions.
[2018-01-28 21:36:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278
[2018-01-28 21:36:06,019 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:36:06,019 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:36:06,019 INFO L371 AbstractCegarLoop]: === Iteration 33 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:36:06,020 INFO L82 PathProgramCache]: Analyzing trace with hash 27492152, now seen corresponding path program 1 times
[2018-01-28 21:36:06,020 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:36:06,020 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:36:06,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:36:06,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:36:06,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:36:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:36:06,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:36:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 220 proven. 336 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2018-01-28 21:36:06,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:36:06,523 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:36:06,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:36:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:36:06,631 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:36:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 230 proven. 326 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked.
[2018-01-28 21:36:06,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:36:06,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17
[2018-01-28 21:36:06,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-01-28 21:36:06,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-01-28 21:36:06,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306
[2018-01-28 21:36:06,964 INFO L87 Difference]: Start difference. First operand 32985 states and 39423 transitions. Second operand 18 states.
[2018-01-28 21:36:11,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:36:11,546 INFO L93 Difference]: Finished difference Result 34405 states and 41127 transitions.
[2018-01-28 21:36:11,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states.
[2018-01-28 21:36:11,567 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 277
[2018-01-28 21:36:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:36:11,624 INFO L225 Difference]: With dead ends: 34405
[2018-01-28 21:36:11,624 INFO L226 Difference]: Without dead ends: 34403
[2018-01-28 21:36:11,638 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 299 SyntacticMatches, 11 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=974, Invalid=4576, Unknown=0, NotChecked=0, Total=5550
[2018-01-28 21:36:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34403 states.
[2018-01-28 21:36:13,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34403 to 32987.
[2018-01-28 21:36:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32987 states.
[2018-01-28 21:36:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32987 states to 32987 states and 39427 transitions.
[2018-01-28 21:36:13,574 INFO L78 Accepts]: Start accepts. Automaton has 32987 states and 39427 transitions. Word has length 277
[2018-01-28 21:36:13,574 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:36:13,574 INFO L432 AbstractCegarLoop]: Abstraction has 32987 states and 39427 transitions.
[2018-01-28 21:36:13,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-01-28 21:36:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 32987 states and 39427 transitions.
[2018-01-28 21:36:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278
[2018-01-28 21:36:13,583 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:36:13,583 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:36:13,583 INFO L371 AbstractCegarLoop]: === Iteration 34 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:36:13,583 INFO L82 PathProgramCache]: Analyzing trace with hash 27492153, now seen corresponding path program 1 times
[2018-01-28 21:36:13,583 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:36:13,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:36:13,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:36:13,584 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:36:13,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:36:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:36:13,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:36:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 116 proven. 402 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked.
[2018-01-28 21:36:14,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:36:14,108 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:36:14,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:36:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:36:14,302 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:36:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 128 proven. 390 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked.
[2018-01-28 21:36:14,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:36:14,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25
[2018-01-28 21:36:14,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states
[2018-01-28 21:36:14,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2018-01-28 21:36:14,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650
[2018-01-28 21:36:14,828 INFO L87 Difference]: Start difference. First operand 32987 states and 39427 transitions. Second operand 26 states.
[2018-01-28 21:36:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:36:23,043 INFO L93 Difference]: Finished difference Result 56623 states and 67923 transitions.
[2018-01-28 21:36:23,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states.
[2018-01-28 21:36:23,043 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 277
[2018-01-28 21:36:23,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:36:23,133 INFO L225 Difference]: With dead ends: 56623
[2018-01-28 21:36:23,133 INFO L226 Difference]: Without dead ends: 56621
[2018-01-28 21:36:23,149 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 291 SyntacticMatches, 15 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2404 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1471, Invalid=7085, Unknown=0, NotChecked=0, Total=8556
[2018-01-28 21:36:23,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56621 states.
[2018-01-28 21:36:26,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56621 to 51479.
[2018-01-28 21:36:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51479 states.
[2018-01-28 21:36:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51479 states to 51479 states and 61811 transitions.
[2018-01-28 21:36:26,159 INFO L78 Accepts]: Start accepts. Automaton has 51479 states and 61811 transitions. Word has length 277
[2018-01-28 21:36:26,159 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:36:26,159 INFO L432 AbstractCegarLoop]: Abstraction has 51479 states and 61811 transitions.
[2018-01-28 21:36:26,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states.
[2018-01-28 21:36:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 51479 states and 61811 transitions.
[2018-01-28 21:36:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279
[2018-01-28 21:36:26,168 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:36:26,168 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 21:36:26,168 INFO L371 AbstractCegarLoop]: === Iteration 35 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:36:26,168 INFO L82 PathProgramCache]: Analyzing trace with hash 852255190, now seen corresponding path program 1 times
[2018-01-28 21:36:26,168 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:36:26,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:36:26,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:36:26,169 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:36:26,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:36:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:36:26,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-28 21:36:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 116 proven. 402 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked.
[2018-01-28 21:36:26,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 21:36:26,407 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 21:36:26,412 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:36:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:36:26,504 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 21:36:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 128 proven. 390 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked.
[2018-01-28 21:36:26,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 21:36:26,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16
[2018-01-28 21:36:26,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-01-28 21:36:26,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-01-28 21:36:26,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240
[2018-01-28 21:36:26,621 INFO L87 Difference]: Start difference. First operand 51479 states and 61811 transitions. Second operand 16 states.
[2018-01-28 21:36:32,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 21:36:32,055 INFO L93 Difference]: Finished difference Result 55041 states and 66108 transitions.
[2018-01-28 21:36:32,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states.
[2018-01-28 21:36:32,055 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 278
[2018-01-28 21:36:32,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 21:36:32,150 INFO L225 Difference]: With dead ends: 55041
[2018-01-28 21:36:32,150 INFO L226 Difference]: Without dead ends: 55038
[2018-01-28 21:36:32,165 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 304 SyntacticMatches, 9 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1990 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=995, Invalid=5325, Unknown=0, NotChecked=0, Total=6320
[2018-01-28 21:36:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55038 states.
[2018-01-28 21:36:35,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55038 to 51479.
[2018-01-28 21:36:35,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51479 states.
[2018-01-28 21:36:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51479 states to 51479 states and 61810 transitions.
[2018-01-28 21:36:35,243 INFO L78 Accepts]: Start accepts. Automaton has 51479 states and 61810 transitions. Word has length 278
[2018-01-28 21:36:35,243 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-28 21:36:35,243 INFO L432 AbstractCegarLoop]: Abstraction has 51479 states and 61810 transitions.
[2018-01-28 21:36:35,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-01-28 21:36:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 51479 states and 61810 transitions.
[2018-01-28 21:36:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285
[2018-01-28 21:36:35,253 INFO L322 BasicCegarLoop]: Found error trace
[2018-01-28 21:36:35,253 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 21:36:35,253 INFO L371 AbstractCegarLoop]: === Iteration 36 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]===
[2018-01-28 21:36:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1186850163, now seen corresponding path program 1 times
[2018-01-28 21:36:35,254 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 21:36:35,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 21:36:35,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:36:35,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 21:36:35,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 21:36:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 21:36:35,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
Received shutdown request...
[2018-01-28 21:36:36,115 WARN L491 AbstractCegarLoop]: Verification canceled
[2018-01-28 21:36:36,120 WARN L185 ceAbstractionStarter]: Timeout
[2018-01-28 21:36:36,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:36:36 BoogieIcfgContainer
[2018-01-28 21:36:36,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-01-28 21:36:36,121 INFO L168 Benchmark]: Toolchain (without parser) took 108943.43 ms. Allocated memory was 303.0 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 263.1 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB.
[2018-01-28 21:36:36,122 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 303.0 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-28 21:36:36,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.90 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 250.9 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB.
[2018-01-28 21:36:36,123 INFO L168 Benchmark]: Boogie Preprocessor took 35.99 ms. Allocated memory is still 303.0 MB. Free memory was 250.9 MB in the beginning and 248.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
[2018-01-28 21:36:36,123 INFO L168 Benchmark]: RCFGBuilder took 427.87 ms. Allocated memory is still 303.0 MB. Free memory was 248.9 MB in the beginning and 219.2 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 5.3 GB.
[2018-01-28 21:36:36,123 INFO L168 Benchmark]: TraceAbstraction took 108265.10 ms. Allocated memory was 303.0 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 219.2 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB.
[2018-01-28 21:36:36,125 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.19 ms. Allocated memory is still 303.0 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 203.90 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 250.9 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 35.99 ms. Allocated memory is still 303.0 MB. Free memory was 250.9 MB in the beginning and 248.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 427.87 ms. Allocated memory is still 303.0 MB. Free memory was 248.9 MB in the beginning and 219.2 MB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 108265.10 ms. Allocated memory was 303.0 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 219.2 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 688]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 688). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 285 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 22.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 122 locations, 19 error locations. TIMEOUT Result, 108.2s OverallTime, 36 OverallIterations, 12 TraceHistogramMax, 66.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7224 SDtfs, 22275 SDslu, 23943 SDs, 0 SdLazy, 47135 SolverSat, 4700 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5323 GetRequests, 3918 SyntacticMatches, 65 SemanticMatches, 1340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50616 ImplicationChecksByTransitivity, 20.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51479occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 26.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 44397 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 7972 NumberOfCodeBlocks, 7972 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 7913 ConstructedInterpolants, 142 QuantifiedInterpolants, 5031792 SizeOfPredicates, 137 NumberOfNonLiveVariables, 14699 ConjunctsInSsa, 522 ConjunctsInUnsatCore, 59 InterpolantComputations, 13 PerfectInterpolantSequences, 10918/14373 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-36-36-134.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-36-36-134.csv
Completed graceful shutdown