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-ext/tree_cnstr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:50:36,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:50:36,142 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:50:36,158 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:50:36,158 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:50:36,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:50:36,160 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:50:36,161 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:50:36,163 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:50:36,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:50:36,165 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:50:36,165 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:50:36,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:50:36,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:50:36,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:50:36,171 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:50:36,173 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:50:36,175 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:50:36,177 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:50:36,178 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:50:36,180 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:50:36,181 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:50:36,181 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:50:36,182 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:50:36,183 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:50:36,184 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:50:36,184 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:50:36,185 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:50:36,185 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:50:36,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:50:36,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:50:36,186 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:50:36,195 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:50:36,195 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:50:36,196 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:50:36,196 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:50:36,196 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:50:36,196 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:50:36,196 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:50:36,197 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:50:36,197 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:50:36,197 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:50:36,197 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:50:36,197 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:50:36,197 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:50:36,198 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:50:36,198 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:50:36,198 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:50:36,198 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:50:36,198 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:50:36,198 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:50:36,198 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:50:36,198 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:50:36,199 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:50:36,199 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:50:36,199 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:50:36,199 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:50:36,199 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:50:36,200 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:50:36,200 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:50:36,200 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:50:36,200 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:50:36,200 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:50:36,200 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:50:36,201 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:50:36,201 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:50:36,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:50:36,243 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:50:36,247 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:50:36,248 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:50:36,248 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:50:36,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-01-28 21:50:36,420 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:50:36,425 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:50:36,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:50:36,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:50:36,431 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:50:36,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:50:36" (1/1) ... [2018-01-28 21:50:36,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4abd8094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:50:36, skipping insertion in model container [2018-01-28 21:50:36,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:50:36" (1/1) ... [2018-01-28 21:50:36,447 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:50:36,485 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:50:36,605 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:50:36,627 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:50:36,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:50:36 WrapperNode [2018-01-28 21:50:36,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:50:36,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:50:36,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:50:36,638 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:50:36,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:50:36" (1/1) ... [2018-01-28 21:50:36,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:50:36" (1/1) ... [2018-01-28 21:50:36,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:50:36" (1/1) ... [2018-01-28 21:50:36,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:50:36" (1/1) ... [2018-01-28 21:50:36,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:50:36" (1/1) ... [2018-01-28 21:50:36,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:50:36" (1/1) ... [2018-01-28 21:50:36,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:50:36" (1/1) ... [2018-01-28 21:50:36,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:50:36,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:50:36,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:50:36,679 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:50:36,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:50:36" (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:50:36,731 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:50:36,731 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:50:36,731 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:50:36,732 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 21:50:36,732 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 21:50:36,732 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:50:36,732 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:50:36,732 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:50:36,732 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:50:36,732 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 21:50:36,733 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 21:50:36,733 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:50:36,733 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:50:36,733 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:50:37,247 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:50:37,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:50:37 BoogieIcfgContainer [2018-01-28 21:50:37,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:50:37,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:50:37,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:50:37,252 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:50:37,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:50:36" (1/3) ... [2018-01-28 21:50:37,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e9c07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:50:37, skipping insertion in model container [2018-01-28 21:50:37,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:50:36" (2/3) ... [2018-01-28 21:50:37,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e9c07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:50:37, skipping insertion in model container [2018-01-28 21:50:37,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:50:37" (3/3) ... [2018-01-28 21:50:37,256 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_cnstr_true-valid-memsafety_false-termination.i [2018-01-28 21:50:37,263 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:50:37,269 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-01-28 21:50:37,318 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:50:37,318 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:50:37,318 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:50:37,318 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:50:37,318 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:50:37,318 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:50:37,318 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:50:37,319 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:50:37,319 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:50:37,337 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2018-01-28 21:50:37,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-28 21:50:37,343 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:37,344 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:37,344 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:37,347 INFO L82 PathProgramCache]: Analyzing trace with hash -378223688, now seen corresponding path program 1 times [2018-01-28 21:50:37,349 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:37,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:37,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:37,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:37,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:37,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:50:37,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:37,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:50:37,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:50:37,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:50:37,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:50:37,599 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 4 states. [2018-01-28 21:50:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:37,884 INFO L93 Difference]: Finished difference Result 405 states and 447 transitions. [2018-01-28 21:50:37,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:50:37,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-28 21:50:37,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:37,900 INFO L225 Difference]: With dead ends: 405 [2018-01-28 21:50:37,900 INFO L226 Difference]: Without dead ends: 235 [2018-01-28 21:50:37,904 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:50:37,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-01-28 21:50:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 174. [2018-01-28 21:50:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-28 21:50:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-01-28 21:50:37,956 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 10 [2018-01-28 21:50:37,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:37,957 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-01-28 21:50:37,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:50:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2018-01-28 21:50:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-28 21:50:37,958 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:37,958 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:37,958 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:37,958 INFO L82 PathProgramCache]: Analyzing trace with hash -378223687, now seen corresponding path program 1 times [2018-01-28 21:50:37,958 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:37,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:37,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:37,960 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:37,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:37,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:38,057 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:50:38,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:38,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:50:38,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:50:38,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:50:38,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:50:38,059 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 4 states. [2018-01-28 21:50:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:38,343 INFO L93 Difference]: Finished difference Result 232 states and 250 transitions. [2018-01-28 21:50:38,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:50:38,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-28 21:50:38,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:38,373 INFO L225 Difference]: With dead ends: 232 [2018-01-28 21:50:38,373 INFO L226 Difference]: Without dead ends: 230 [2018-01-28 21:50:38,374 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:50:38,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-28 21:50:38,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 172. [2018-01-28 21:50:38,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-28 21:50:38,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 185 transitions. [2018-01-28 21:50:38,389 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 185 transitions. Word has length 10 [2018-01-28 21:50:38,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:38,389 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 185 transitions. [2018-01-28 21:50:38,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:50:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 185 transitions. [2018-01-28 21:50:38,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-28 21:50:38,390 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:38,390 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:38,390 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:38,390 INFO L82 PathProgramCache]: Analyzing trace with hash 222782567, now seen corresponding path program 1 times [2018-01-28 21:50:38,391 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:38,391 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:38,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:38,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:38,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:38,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:38,446 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:50:38,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:38,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:50:38,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:50:38,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:50:38,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:50:38,447 INFO L87 Difference]: Start difference. First operand 172 states and 185 transitions. Second operand 4 states. [2018-01-28 21:50:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:38,587 INFO L93 Difference]: Finished difference Result 240 states and 264 transitions. [2018-01-28 21:50:38,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:50:38,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-28 21:50:38,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:38,589 INFO L225 Difference]: With dead ends: 240 [2018-01-28 21:50:38,589 INFO L226 Difference]: Without dead ends: 222 [2018-01-28 21:50:38,590 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:50:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-28 21:50:38,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 164. [2018-01-28 21:50:38,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-28 21:50:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2018-01-28 21:50:38,600 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 18 [2018-01-28 21:50:38,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:38,600 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2018-01-28 21:50:38,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:50:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2018-01-28 21:50:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-28 21:50:38,601 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:38,601 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:38,601 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:38,601 INFO L82 PathProgramCache]: Analyzing trace with hash 222782568, now seen corresponding path program 1 times [2018-01-28 21:50:38,601 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:38,602 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:38,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:38,603 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:38,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:38,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:38,704 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:50:38,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:38,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:50:38,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:50:38,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:50:38,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:50:38,705 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand 5 states. [2018-01-28 21:50:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:38,980 INFO L93 Difference]: Finished difference Result 362 states and 396 transitions. [2018-01-28 21:50:38,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:50:38,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-28 21:50:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:38,982 INFO L225 Difference]: With dead ends: 362 [2018-01-28 21:50:38,982 INFO L226 Difference]: Without dead ends: 344 [2018-01-28 21:50:38,982 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:50:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-01-28 21:50:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 282. [2018-01-28 21:50:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-01-28 21:50:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 340 transitions. [2018-01-28 21:50:38,999 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 340 transitions. Word has length 18 [2018-01-28 21:50:38,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:38,999 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 340 transitions. [2018-01-28 21:50:38,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:50:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 340 transitions. [2018-01-28 21:50:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-28 21:50:39,000 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:39,000 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] [2018-01-28 21:50:39,000 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:39,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1733899743, now seen corresponding path program 1 times [2018-01-28 21:50:39,001 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:39,001 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:39,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:39,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:39,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:39,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:39,060 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:50:39,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:39,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:50:39,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:50:39,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:50:39,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:50:39,061 INFO L87 Difference]: Start difference. First operand 282 states and 340 transitions. Second operand 4 states. [2018-01-28 21:50:39,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:39,082 INFO L93 Difference]: Finished difference Result 299 states and 343 transitions. [2018-01-28 21:50:39,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:50:39,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-28 21:50:39,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:39,084 INFO L225 Difference]: With dead ends: 299 [2018-01-28 21:50:39,084 INFO L226 Difference]: Without dead ends: 296 [2018-01-28 21:50:39,084 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:50:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-01-28 21:50:39,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 282. [2018-01-28 21:50:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-01-28 21:50:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 338 transitions. [2018-01-28 21:50:39,094 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 338 transitions. Word has length 21 [2018-01-28 21:50:39,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:39,094 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 338 transitions. [2018-01-28 21:50:39,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:50:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 338 transitions. [2018-01-28 21:50:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 21:50:39,096 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:39,096 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] [2018-01-28 21:50:39,096 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:39,096 INFO L82 PathProgramCache]: Analyzing trace with hash 555791689, now seen corresponding path program 1 times [2018-01-28 21:50:39,096 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:39,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:39,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:39,097 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:39,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:39,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:39,133 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:50:39,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:39,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:50:39,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:50:39,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:50:39,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:50:39,134 INFO L87 Difference]: Start difference. First operand 282 states and 338 transitions. Second operand 3 states. [2018-01-28 21:50:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:39,148 INFO L93 Difference]: Finished difference Result 404 states and 498 transitions. [2018-01-28 21:50:39,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:50:39,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-01-28 21:50:39,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:39,150 INFO L225 Difference]: With dead ends: 404 [2018-01-28 21:50:39,150 INFO L226 Difference]: Without dead ends: 285 [2018-01-28 21:50:39,151 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:50:39,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-01-28 21:50:39,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-01-28 21:50:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-01-28 21:50:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 341 transitions. [2018-01-28 21:50:39,161 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 341 transitions. Word has length 31 [2018-01-28 21:50:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:39,162 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 341 transitions. [2018-01-28 21:50:39,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:50:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 341 transitions. [2018-01-28 21:50:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 21:50:39,163 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:39,163 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:39,164 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:39,164 INFO L82 PathProgramCache]: Analyzing trace with hash -491358847, now seen corresponding path program 1 times [2018-01-28 21:50:39,164 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:39,164 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:39,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:39,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:39,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:39,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:39,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:50:39,203 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:39,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:50:39,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:50:39,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:50:39,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:50:39,204 INFO L87 Difference]: Start difference. First operand 285 states and 341 transitions. Second operand 3 states. [2018-01-28 21:50:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:39,246 INFO L93 Difference]: Finished difference Result 561 states and 675 transitions. [2018-01-28 21:50:39,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:50:39,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-01-28 21:50:39,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:39,248 INFO L225 Difference]: With dead ends: 561 [2018-01-28 21:50:39,249 INFO L226 Difference]: Without dead ends: 287 [2018-01-28 21:50:39,250 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:50:39,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-28 21:50:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-01-28 21:50:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-01-28 21:50:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 343 transitions. [2018-01-28 21:50:39,262 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 343 transitions. Word has length 32 [2018-01-28 21:50:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:39,263 INFO L432 AbstractCegarLoop]: Abstraction has 287 states and 343 transitions. [2018-01-28 21:50:39,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:50:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 343 transitions. [2018-01-28 21:50:39,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 21:50:39,264 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:39,264 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] [2018-01-28 21:50:39,264 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:39,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1592506290, now seen corresponding path program 1 times [2018-01-28 21:50:39,265 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:39,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:39,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:39,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:39,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:39,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:39,327 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:50:39,327 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:39,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:50:39,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:50:39,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:50:39,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:50:39,330 INFO L87 Difference]: Start difference. First operand 287 states and 343 transitions. Second operand 3 states. [2018-01-28 21:50:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:39,376 INFO L93 Difference]: Finished difference Result 429 states and 516 transitions. [2018-01-28 21:50:39,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:50:39,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-01-28 21:50:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:39,379 INFO L225 Difference]: With dead ends: 429 [2018-01-28 21:50:39,379 INFO L226 Difference]: Without dead ends: 307 [2018-01-28 21:50:39,380 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:50:39,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-01-28 21:50:39,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 291. [2018-01-28 21:50:39,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-01-28 21:50:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 344 transitions. [2018-01-28 21:50:39,393 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 344 transitions. Word has length 33 [2018-01-28 21:50:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:39,393 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 344 transitions. [2018-01-28 21:50:39,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:50:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 344 transitions. [2018-01-28 21:50:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 21:50:39,394 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:39,394 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:39,394 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:39,395 INFO L82 PathProgramCache]: Analyzing trace with hash 121526494, now seen corresponding path program 1 times [2018-01-28 21:50:39,395 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:39,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:39,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:39,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:39,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:39,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:50:39,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:39,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:50:39,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:50:39,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:50:39,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:50:39,571 INFO L87 Difference]: Start difference. First operand 291 states and 344 transitions. Second operand 6 states. [2018-01-28 21:50:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:39,896 INFO L93 Difference]: Finished difference Result 730 states and 852 transitions. [2018-01-28 21:50:39,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:50:39,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-28 21:50:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:39,898 INFO L225 Difference]: With dead ends: 730 [2018-01-28 21:50:39,898 INFO L226 Difference]: Without dead ends: 450 [2018-01-28 21:50:39,899 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:50:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-01-28 21:50:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 322. [2018-01-28 21:50:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-01-28 21:50:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 380 transitions. [2018-01-28 21:50:39,911 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 380 transitions. Word has length 34 [2018-01-28 21:50:39,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:39,911 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 380 transitions. [2018-01-28 21:50:39,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:50:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 380 transitions. [2018-01-28 21:50:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 21:50:39,913 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:39,913 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, 1] [2018-01-28 21:50:39,913 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:39,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1711750446, now seen corresponding path program 1 times [2018-01-28 21:50:39,914 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:39,914 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:39,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:39,915 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:39,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:39,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:40,116 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:50:40,116 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:40,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:50:40,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:50:40,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:50:40,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:50:40,117 INFO L87 Difference]: Start difference. First operand 322 states and 380 transitions. Second operand 7 states. [2018-01-28 21:50:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:40,444 INFO L93 Difference]: Finished difference Result 724 states and 852 transitions. [2018-01-28 21:50:40,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:50:40,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-01-28 21:50:40,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:40,447 INFO L225 Difference]: With dead ends: 724 [2018-01-28 21:50:40,447 INFO L226 Difference]: Without dead ends: 413 [2018-01-28 21:50:40,448 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:50:40,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-01-28 21:50:40,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 334. [2018-01-28 21:50:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-01-28 21:50:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 392 transitions. [2018-01-28 21:50:40,466 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 392 transitions. Word has length 35 [2018-01-28 21:50:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:40,466 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 392 transitions. [2018-01-28 21:50:40,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:50:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 392 transitions. [2018-01-28 21:50:40,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:50:40,467 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:40,468 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, 1, 1, 1] [2018-01-28 21:50:40,468 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:40,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1264439701, now seen corresponding path program 1 times [2018-01-28 21:50:40,471 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:40,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:40,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:40,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:40,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:40,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:40,533 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:50:40,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:40,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:50:40,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:50:40,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:50:40,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:50:40,534 INFO L87 Difference]: Start difference. First operand 334 states and 392 transitions. Second operand 5 states. [2018-01-28 21:50:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:40,854 INFO L93 Difference]: Finished difference Result 549 states and 634 transitions. [2018-01-28 21:50:40,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:50:40,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-28 21:50:40,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:40,857 INFO L225 Difference]: With dead ends: 549 [2018-01-28 21:50:40,857 INFO L226 Difference]: Without dead ends: 548 [2018-01-28 21:50:40,858 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:50:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-01-28 21:50:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 333. [2018-01-28 21:50:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-01-28 21:50:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 390 transitions. [2018-01-28 21:50:40,873 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 390 transitions. Word has length 37 [2018-01-28 21:50:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:40,873 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 390 transitions. [2018-01-28 21:50:40,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:50:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 390 transitions. [2018-01-28 21:50:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:50:40,874 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:40,874 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, 1, 1, 1] [2018-01-28 21:50:40,874 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:40,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1264439700, now seen corresponding path program 1 times [2018-01-28 21:50:40,874 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:40,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:40,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:40,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:40,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:40,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:40,958 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:50:40,958 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:40,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:50:40,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:50:40,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:50:40,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:50:40,959 INFO L87 Difference]: Start difference. First operand 333 states and 390 transitions. Second operand 5 states. [2018-01-28 21:50:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:41,361 INFO L93 Difference]: Finished difference Result 604 states and 711 transitions. [2018-01-28 21:50:41,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:50:41,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-28 21:50:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:41,365 INFO L225 Difference]: With dead ends: 604 [2018-01-28 21:50:41,365 INFO L226 Difference]: Without dead ends: 603 [2018-01-28 21:50:41,366 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:50:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-01-28 21:50:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 332. [2018-01-28 21:50:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-01-28 21:50:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 388 transitions. [2018-01-28 21:50:41,384 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 388 transitions. Word has length 37 [2018-01-28 21:50:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:41,385 INFO L432 AbstractCegarLoop]: Abstraction has 332 states and 388 transitions. [2018-01-28 21:50:41,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:50:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 388 transitions. [2018-01-28 21:50:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:50:41,386 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:41,386 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:41,386 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:41,386 INFO L82 PathProgramCache]: Analyzing trace with hash -277169441, now seen corresponding path program 1 times [2018-01-28 21:50:41,386 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:41,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:41,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:41,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:41,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:41,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:50:41,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:41,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:50:41,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:50:41,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:50:41,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:50:41,499 INFO L87 Difference]: Start difference. First operand 332 states and 388 transitions. Second operand 6 states. [2018-01-28 21:50:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:42,429 INFO L93 Difference]: Finished difference Result 585 states and 683 transitions. [2018-01-28 21:50:42,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:50:42,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-28 21:50:42,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:42,431 INFO L225 Difference]: With dead ends: 585 [2018-01-28 21:50:42,431 INFO L226 Difference]: Without dead ends: 459 [2018-01-28 21:50:42,432 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:50:42,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-01-28 21:50:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 395. [2018-01-28 21:50:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-01-28 21:50:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 472 transitions. [2018-01-28 21:50:42,445 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 472 transitions. Word has length 38 [2018-01-28 21:50:42,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:42,445 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 472 transitions. [2018-01-28 21:50:42,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:50:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 472 transitions. [2018-01-28 21:50:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:50:42,446 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:42,446 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:42,446 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:42,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1743760894, now seen corresponding path program 1 times [2018-01-28 21:50:42,447 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:42,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:42,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:42,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:42,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:42,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:50:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:50:42,566 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:50:42,566 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:50:42,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:42,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:50:42,978 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~n~4.base Int)) (and (not (= 0 main_~n~4.base)) (= |c_#valid| (store |c_old(#valid)| main_~n~4.base 0)) (= 0 (select |c_old(#valid)| main_~n~4.base)))) is different from true [2018-01-28 21:50:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-28 21:50:43,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:50:43,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2018-01-28 21:50:43,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 21:50:43,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 21:50:43,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=89, Unknown=1, NotChecked=18, Total=132 [2018-01-28 21:50:43,011 INFO L87 Difference]: Start difference. First operand 395 states and 472 transitions. Second operand 12 states. [2018-01-28 21:50:44,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:44,428 INFO L93 Difference]: Finished difference Result 547 states and 642 transitions. [2018-01-28 21:50:44,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:50:44,428 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-01-28 21:50:44,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:44,431 INFO L225 Difference]: With dead ends: 547 [2018-01-28 21:50:44,431 INFO L226 Difference]: Without dead ends: 544 [2018-01-28 21:50:44,432 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=232, Unknown=1, NotChecked=32, Total=342 [2018-01-28 21:50:44,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-01-28 21:50:44,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 408. [2018-01-28 21:50:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-01-28 21:50:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 486 transitions. [2018-01-28 21:50:44,461 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 486 transitions. Word has length 38 [2018-01-28 21:50:44,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:44,461 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 486 transitions. [2018-01-28 21:50:44,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 21:50:44,461 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 486 transitions. [2018-01-28 21:50:44,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 21:50:44,462 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:44,462 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:44,462 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:44,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2085726266, now seen corresponding path program 1 times [2018-01-28 21:50:44,463 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:44,463 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:44,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:44,464 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:44,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:44,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:50:44,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:44,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:50:44,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:50:44,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:50:44,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:50:44,683 INFO L87 Difference]: Start difference. First operand 408 states and 486 transitions. Second operand 8 states. [2018-01-28 21:50:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:45,259 INFO L93 Difference]: Finished difference Result 778 states and 914 transitions. [2018-01-28 21:50:45,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:50:45,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-01-28 21:50:45,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:45,262 INFO L225 Difference]: With dead ends: 778 [2018-01-28 21:50:45,262 INFO L226 Difference]: Without dead ends: 598 [2018-01-28 21:50:45,263 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:50:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-01-28 21:50:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 523. [2018-01-28 21:50:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-01-28 21:50:45,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 625 transitions. [2018-01-28 21:50:45,291 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 625 transitions. Word has length 40 [2018-01-28 21:50:45,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:45,291 INFO L432 AbstractCegarLoop]: Abstraction has 523 states and 625 transitions. [2018-01-28 21:50:45,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:50:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 625 transitions. [2018-01-28 21:50:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 21:50:45,292 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:45,292 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:45,292 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:45,293 INFO L82 PathProgramCache]: Analyzing trace with hash 716150274, now seen corresponding path program 1 times [2018-01-28 21:50:45,293 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:45,293 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:45,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:45,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:45,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:45,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:50:45,327 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:45,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:50:45,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:50:45,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:50:45,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:50:45,328 INFO L87 Difference]: Start difference. First operand 523 states and 625 transitions. Second operand 3 states. [2018-01-28 21:50:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:45,354 INFO L93 Difference]: Finished difference Result 544 states and 633 transitions. [2018-01-28 21:50:45,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:50:45,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-01-28 21:50:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:45,357 INFO L225 Difference]: With dead ends: 544 [2018-01-28 21:50:45,357 INFO L226 Difference]: Without dead ends: 457 [2018-01-28 21:50:45,357 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:50:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-01-28 21:50:45,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 456. [2018-01-28 21:50:45,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-01-28 21:50:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 534 transitions. [2018-01-28 21:50:45,380 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 534 transitions. Word has length 40 [2018-01-28 21:50:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:45,380 INFO L432 AbstractCegarLoop]: Abstraction has 456 states and 534 transitions. [2018-01-28 21:50:45,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:50:45,380 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 534 transitions. [2018-01-28 21:50:45,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 21:50:45,381 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:45,381 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, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:45,381 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:45,381 INFO L82 PathProgramCache]: Analyzing trace with hash -2059868089, now seen corresponding path program 1 times [2018-01-28 21:50:45,381 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:45,382 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:45,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:45,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:45,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:45,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:45,516 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:50:45,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:45,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:50:45,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:50:45,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:50:45,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:50:45,517 INFO L87 Difference]: Start difference. First operand 456 states and 534 transitions. Second operand 9 states. [2018-01-28 21:50:46,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:46,046 INFO L93 Difference]: Finished difference Result 644 states and 760 transitions. [2018-01-28 21:50:46,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:50:46,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-01-28 21:50:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:46,049 INFO L225 Difference]: With dead ends: 644 [2018-01-28 21:50:46,049 INFO L226 Difference]: Without dead ends: 643 [2018-01-28 21:50:46,050 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:50:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-01-28 21:50:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 455. [2018-01-28 21:50:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-01-28 21:50:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 531 transitions. [2018-01-28 21:50:46,073 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 531 transitions. Word has length 40 [2018-01-28 21:50:46,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:46,074 INFO L432 AbstractCegarLoop]: Abstraction has 455 states and 531 transitions. [2018-01-28 21:50:46,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:50:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 531 transitions. [2018-01-28 21:50:46,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 21:50:46,074 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:46,075 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, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:46,075 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:46,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2059868088, now seen corresponding path program 1 times [2018-01-28 21:50:46,075 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:46,075 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:46,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:46,076 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:46,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:46,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:46,206 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:50:46,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:46,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:50:46,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:50:46,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:50:46,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:50:46,208 INFO L87 Difference]: Start difference. First operand 455 states and 531 transitions. Second operand 9 states. [2018-01-28 21:50:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:46,687 INFO L93 Difference]: Finished difference Result 643 states and 757 transitions. [2018-01-28 21:50:46,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:50:46,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-01-28 21:50:46,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:46,689 INFO L225 Difference]: With dead ends: 643 [2018-01-28 21:50:46,689 INFO L226 Difference]: Without dead ends: 642 [2018-01-28 21:50:46,690 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:50:46,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-01-28 21:50:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 454. [2018-01-28 21:50:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-01-28 21:50:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 528 transitions. [2018-01-28 21:50:46,712 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 528 transitions. Word has length 40 [2018-01-28 21:50:46,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:46,712 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 528 transitions. [2018-01-28 21:50:46,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:50:46,713 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 528 transitions. [2018-01-28 21:50:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-28 21:50:46,713 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:46,713 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:46,714 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:46,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1497242211, now seen corresponding path program 1 times [2018-01-28 21:50:46,714 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:46,714 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:46,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:46,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:46,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:46,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:46,761 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:50:46,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:46,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:50:46,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:50:46,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:50:46,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:50:46,771 INFO L87 Difference]: Start difference. First operand 454 states and 528 transitions. Second operand 3 states. [2018-01-28 21:50:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:46,805 INFO L93 Difference]: Finished difference Result 702 states and 808 transitions. [2018-01-28 21:50:46,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:50:46,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-01-28 21:50:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:46,808 INFO L225 Difference]: With dead ends: 702 [2018-01-28 21:50:46,808 INFO L226 Difference]: Without dead ends: 459 [2018-01-28 21:50:46,809 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:50:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-01-28 21:50:46,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2018-01-28 21:50:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-01-28 21:50:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 531 transitions. [2018-01-28 21:50:46,828 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 531 transitions. Word has length 44 [2018-01-28 21:50:46,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:46,829 INFO L432 AbstractCegarLoop]: Abstraction has 457 states and 531 transitions. [2018-01-28 21:50:46,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:50:46,829 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 531 transitions. [2018-01-28 21:50:46,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 21:50:46,829 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:46,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:46,830 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:46,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1248421984, now seen corresponding path program 1 times [2018-01-28 21:50:46,830 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:46,830 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:46,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:46,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:46,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:46,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:46,878 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:50:46,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:46,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:50:46,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:50:46,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:50:46,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:50:46,880 INFO L87 Difference]: Start difference. First operand 457 states and 531 transitions. Second operand 5 states. [2018-01-28 21:50:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:47,124 INFO L93 Difference]: Finished difference Result 671 states and 770 transitions. [2018-01-28 21:50:47,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:50:47,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-01-28 21:50:47,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:47,127 INFO L225 Difference]: With dead ends: 671 [2018-01-28 21:50:47,127 INFO L226 Difference]: Without dead ends: 670 [2018-01-28 21:50:47,127 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:50:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-01-28 21:50:47,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 456. [2018-01-28 21:50:47,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-01-28 21:50:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 529 transitions. [2018-01-28 21:50:47,140 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 529 transitions. Word has length 46 [2018-01-28 21:50:47,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:47,140 INFO L432 AbstractCegarLoop]: Abstraction has 456 states and 529 transitions. [2018-01-28 21:50:47,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:50:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 529 transitions. [2018-01-28 21:50:47,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 21:50:47,141 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:47,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:47,141 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:47,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1248421983, now seen corresponding path program 1 times [2018-01-28 21:50:47,141 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:47,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:47,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:47,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:47,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:47,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:47,259 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:50:47,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:47,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:50:47,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:50:47,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:50:47,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:50:47,260 INFO L87 Difference]: Start difference. First operand 456 states and 529 transitions. Second operand 5 states. [2018-01-28 21:50:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:47,459 INFO L93 Difference]: Finished difference Result 681 states and 779 transitions. [2018-01-28 21:50:47,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:50:47,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-01-28 21:50:47,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:47,463 INFO L225 Difference]: With dead ends: 681 [2018-01-28 21:50:47,463 INFO L226 Difference]: Without dead ends: 680 [2018-01-28 21:50:47,463 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:50:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-01-28 21:50:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 455. [2018-01-28 21:50:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-01-28 21:50:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 527 transitions. [2018-01-28 21:50:47,484 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 527 transitions. Word has length 46 [2018-01-28 21:50:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:47,485 INFO L432 AbstractCegarLoop]: Abstraction has 455 states and 527 transitions. [2018-01-28 21:50:47,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:50:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 527 transitions. [2018-01-28 21:50:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 21:50:47,485 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:47,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:47,486 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:47,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1617389092, now seen corresponding path program 1 times [2018-01-28 21:50:47,486 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:47,486 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:47,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:47,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:47,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:47,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:47,624 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:50:47,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:47,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:50:47,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:50:47,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:50:47,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:50:47,625 INFO L87 Difference]: Start difference. First operand 455 states and 527 transitions. Second operand 9 states. [2018-01-28 21:50:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:47,977 INFO L93 Difference]: Finished difference Result 584 states and 685 transitions. [2018-01-28 21:50:47,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:50:47,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-01-28 21:50:47,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:47,979 INFO L225 Difference]: With dead ends: 584 [2018-01-28 21:50:47,979 INFO L226 Difference]: Without dead ends: 583 [2018-01-28 21:50:47,979 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:50:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-01-28 21:50:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 454. [2018-01-28 21:50:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-01-28 21:50:47,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 526 transitions. [2018-01-28 21:50:47,998 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 526 transitions. Word has length 49 [2018-01-28 21:50:47,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:47,998 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 526 transitions. [2018-01-28 21:50:47,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:50:47,998 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 526 transitions. [2018-01-28 21:50:47,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 21:50:47,999 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:47,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:50:47,999 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:48,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1617389091, now seen corresponding path program 1 times [2018-01-28 21:50:48,000 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:48,000 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:48,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:48,001 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:48,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:48,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:48,145 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:50:48,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:50:48,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:50:48,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:50:48,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:50:48,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:50:48,146 INFO L87 Difference]: Start difference. First operand 454 states and 526 transitions. Second operand 9 states. [2018-01-28 21:50:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:50:48,490 INFO L93 Difference]: Finished difference Result 583 states and 684 transitions. [2018-01-28 21:50:48,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:50:48,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2018-01-28 21:50:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:50:48,492 INFO L225 Difference]: With dead ends: 583 [2018-01-28 21:50:48,492 INFO L226 Difference]: Without dead ends: 582 [2018-01-28 21:50:48,492 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:50:48,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-01-28 21:50:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 453. [2018-01-28 21:50:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-01-28 21:50:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 525 transitions. [2018-01-28 21:50:48,510 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 525 transitions. Word has length 49 [2018-01-28 21:50:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:50:48,510 INFO L432 AbstractCegarLoop]: Abstraction has 453 states and 525 transitions. [2018-01-28 21:50:48,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:50:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 525 transitions. [2018-01-28 21:50:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-28 21:50:48,512 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:50:48,512 INFO L330 BasicCegarLoop]: trace histogram [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] [2018-01-28 21:50:48,512 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:50:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1101485853, now seen corresponding path program 1 times [2018-01-28 21:50:48,512 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:50:48,512 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:50:48,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:48,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:48,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:50:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:48,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:50:49,085 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:50:49,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:50:49,085 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:50:49,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:50:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:50:49,119 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:50:49,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 21:50:49,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 21:50:49,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 21:50:49,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 21:50:49,180 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,185 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-01-28 21:50:49,284 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:50:49,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:50:49,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 21:50:49,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:50:49,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2018-01-28 21:50:49,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-01-28 21:50:49,344 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:50:49,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 21:50:49,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-01-28 21:50:49,385 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:50:49,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 21:50:49,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:50:49,411 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:57, output treesize:39 [2018-01-28 21:50:49,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-01-28 21:50:49,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 21:50:49,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-28 21:50:49,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 21:50:49,559 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 21:50:49,573 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:61 [2018-01-28 21:50:49,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-01-28 21:50:49,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-28 21:50:49,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-01-28 21:50:49,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-28 21:50:49,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:50:49,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 21:50:49,726 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:87 [2018-01-28 21:50:53,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-01-28 21:50:53,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:50:53,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:50:53,798 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:50:53,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-01-28 21:50:53,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:50:53,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-28 21:50:53,813 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:50:53,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:50:53,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-28 21:50:53,831 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:50:53,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-28 21:50:53,831 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:50:53,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-28 21:50:53,836 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:50:53,838 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:50:53,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:50:53,843 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:80, output treesize:7 [2018-01-28 21:50:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-28 21:50:53,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:50:53,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [16] total 30 [2018-01-28 21:50:53,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-28 21:50:53,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-28 21:50:53,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=770, Unknown=2, NotChecked=0, Total=870 [2018-01-28 21:50:53,912 INFO L87 Difference]: Start difference. First operand 453 states and 525 transitions. Second operand 30 states. [2018-01-28 21:51:04,219 WARN L146 SmtUtils]: Spent 2057ms on a formula simplification. DAG size of input: 83 DAG size of output 47 [2018-01-28 21:51:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:51:11,657 INFO L93 Difference]: Finished difference Result 978 states and 1101 transitions. [2018-01-28 21:51:11,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-28 21:51:11,658 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 71 [2018-01-28 21:51:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:51:11,659 INFO L225 Difference]: With dead ends: 978 [2018-01-28 21:51:11,659 INFO L226 Difference]: Without dead ends: 536 [2018-01-28 21:51:11,661 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=810, Invalid=2487, Unknown=9, NotChecked=0, Total=3306 [2018-01-28 21:51:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-01-28 21:51:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 397. [2018-01-28 21:51:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-01-28 21:51:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 450 transitions. [2018-01-28 21:51:11,680 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 450 transitions. Word has length 71 [2018-01-28 21:51:11,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:51:11,680 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 450 transitions. [2018-01-28 21:51:11,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-28 21:51:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 450 transitions. [2018-01-28 21:51:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-28 21:51:11,681 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:51:11,682 INFO L330 BasicCegarLoop]: trace histogram [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:51:11,682 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:51:11,682 INFO L82 PathProgramCache]: Analyzing trace with hash -194085328, now seen corresponding path program 1 times [2018-01-28 21:51:11,682 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:51:11,682 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:51:11,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:11,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:11,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:51:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:11,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:51:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:51:12,062 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:51:12,062 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:51:12,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:51:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:51:12,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:51:12,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:12,296 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:12,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 21:51:12,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:12,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:12,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:31 [2018-01-28 21:51:12,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-28 21:51:12,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:12,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 21:51:12,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:12,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:12,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-28 21:51:12,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:12,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 21:51:12,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:12,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:12,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:12,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2018-01-28 21:51:12,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-01-28 21:51:12,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-28 21:51:12,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:12,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:12,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 58 [2018-01-28 21:51:12,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-28 21:51:12,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:12,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:12,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:51:12,518 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:63 [2018-01-28 21:51:12,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 80 [2018-01-28 21:51:12,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-28 21:51:12,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:12,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:12,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-01-28 21:51:12,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-28 21:51:12,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:12,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:12,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 21:51:12,676 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:107, output treesize:87 [2018-01-28 21:51:18,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-01-28 21:51:18,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:51:18,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-01-28 21:51:18,832 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:51:18,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-28 21:51:18,838 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:18,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:51:18,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-28 21:51:18,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-28 21:51:18,853 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:18,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-28 21:51:18,857 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:51:18,858 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:18,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:51:18,863 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:7 [2018-01-28 21:51:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:51:18,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:51:18,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2018-01-28 21:51:18,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 21:51:18,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 21:51:18,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=676, Unknown=3, NotChecked=0, Total=812 [2018-01-28 21:51:18,907 INFO L87 Difference]: Start difference. First operand 397 states and 450 transitions. Second operand 29 states. [2018-01-28 21:52:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:52:10,989 INFO L93 Difference]: Finished difference Result 1369 states and 1579 transitions. [2018-01-28 21:52:10,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-28 21:52:10,989 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 73 [2018-01-28 21:52:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:52:10,992 INFO L225 Difference]: With dead ends: 1369 [2018-01-28 21:52:10,992 INFO L226 Difference]: Without dead ends: 1014 [2018-01-28 21:52:10,993 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 45.9s TimeCoverageRelationStatistics Valid=909, Invalid=2975, Unknown=22, NotChecked=0, Total=3906 [2018-01-28 21:52:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2018-01-28 21:52:11,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 457. [2018-01-28 21:52:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-01-28 21:52:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 517 transitions. [2018-01-28 21:52:11,009 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 517 transitions. Word has length 73 [2018-01-28 21:52:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:52:11,009 INFO L432 AbstractCegarLoop]: Abstraction has 457 states and 517 transitions. [2018-01-28 21:52:11,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 21:52:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 517 transitions. [2018-01-28 21:52:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-28 21:52:11,010 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:52:11,010 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:11,010 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:52:11,010 INFO L82 PathProgramCache]: Analyzing trace with hash -762058959, now seen corresponding path program 1 times [2018-01-28 21:52:11,010 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:52:11,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:52:11,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:52:11,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:52:11,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:52:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:52:11,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:52:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 21:52:11,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:52:11,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:52:11,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:52:11,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:52:11,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:52:11,146 INFO L87 Difference]: Start difference. First operand 457 states and 517 transitions. Second operand 6 states. [2018-01-28 21:52:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:52:11,283 INFO L93 Difference]: Finished difference Result 619 states and 714 transitions. [2018-01-28 21:52:11,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:52:11,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-01-28 21:52:11,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:52:11,285 INFO L225 Difference]: With dead ends: 619 [2018-01-28 21:52:11,285 INFO L226 Difference]: Without dead ends: 483 [2018-01-28 21:52:11,285 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:52:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-01-28 21:52:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 473. [2018-01-28 21:52:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-01-28 21:52:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 534 transitions. [2018-01-28 21:52:11,299 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 534 transitions. Word has length 77 [2018-01-28 21:52:11,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:52:11,300 INFO L432 AbstractCegarLoop]: Abstraction has 473 states and 534 transitions. [2018-01-28 21:52:11,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:52:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 534 transitions. [2018-01-28 21:52:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-28 21:52:11,300 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:52:11,301 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:11,301 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:52:11,301 INFO L82 PathProgramCache]: Analyzing trace with hash 491178793, now seen corresponding path program 1 times [2018-01-28 21:52:11,301 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:52:11,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:52:11,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:52:11,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:52:11,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:52:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:52:11,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:52:12,060 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 35 DAG size of output 29 [2018-01-28 21:52:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:52:12,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:52:12,230 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:52:12,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:52:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:52:12,267 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:52:12,325 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:52:12,325 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:52:12,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-28 21:52:12,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:12,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:12,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:42 [2018-01-28 21:52:12,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-28 21:52:12,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:52:12,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 21:52:12,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:12,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:12,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-28 21:52:12,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:52:12,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-28 21:52:12,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:12,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:12,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:12,412 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:66 [2018-01-28 21:52:12,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 79 [2018-01-28 21:52:12,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-28 21:52:12,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:12,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:12,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-01-28 21:52:12,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-28 21:52:12,512 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:12,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:12,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:52:12,531 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:112, output treesize:92 [2018-01-28 21:52:12,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 101 [2018-01-28 21:52:12,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-28 21:52:12,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:12,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:12,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2018-01-28 21:52:12,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-28 21:52:12,657 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:12,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:12,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 21:52:12,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:136, output treesize:116 [2018-01-28 21:52:18,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-01-28 21:52:18,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:52:18,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-28 21:52:18,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:18,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-28 21:52:18,820 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:18,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:18,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:52:18,831 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:104, output treesize:69 [2018-01-28 21:52:18,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:52:18,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:52:18,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [15] total 25 [2018-01-28 21:52:18,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-28 21:52:18,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-28 21:52:18,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=483, Unknown=3, NotChecked=0, Total=600 [2018-01-28 21:52:18,940 INFO L87 Difference]: Start difference. First operand 473 states and 534 transitions. Second operand 25 states. [2018-01-28 21:52:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:52:59,053 INFO L93 Difference]: Finished difference Result 1102 states and 1255 transitions. [2018-01-28 21:52:59,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-28 21:52:59,054 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-01-28 21:52:59,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:52:59,056 INFO L225 Difference]: With dead ends: 1102 [2018-01-28 21:52:59,056 INFO L226 Difference]: Without dead ends: 950 [2018-01-28 21:52:59,057 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=686, Invalid=2720, Unknown=16, NotChecked=0, Total=3422 [2018-01-28 21:52:59,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2018-01-28 21:52:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 553. [2018-01-28 21:52:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-01-28 21:52:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 636 transitions. [2018-01-28 21:52:59,076 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 636 transitions. Word has length 77 [2018-01-28 21:52:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:52:59,076 INFO L432 AbstractCegarLoop]: Abstraction has 553 states and 636 transitions. [2018-01-28 21:52:59,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-28 21:52:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 636 transitions. [2018-01-28 21:52:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-28 21:52:59,077 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:52:59,077 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:59,077 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-28 21:52:59,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1258871376, now seen corresponding path program 1 times [2018-01-28 21:52:59,077 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:52:59,077 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:52:59,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:52:59,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:52:59,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:52:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:52:59,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:52:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:52:59,419 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:52:59,419 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:52:59,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:52:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:52:59,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:52:59,546 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:52:59,546 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:52:59,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 21:52:59,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:59,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:59,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-01-28 21:52:59,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 21:52:59,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 21:52:59,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:52:59,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:59,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:52:59,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 Received shutdown request... [2018-01-28 21:52:59,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 48 [2018-01-28 21:52:59,931 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-28 21:52:59,931 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 21:52:59,937 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 21:52:59,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:52:59 BoogieIcfgContainer [2018-01-28 21:52:59,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:52:59,939 INFO L168 Benchmark]: Toolchain (without parser) took 143518.51 ms. Allocated memory was 298.8 MB in the beginning and 601.9 MB in the end (delta: 303.0 MB). Free memory was 258.7 MB in the beginning and 308.2 MB in the end (delta: -49.5 MB). Peak memory consumption was 253.5 MB. Max. memory is 5.3 GB. [2018-01-28 21:52:59,940 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 298.8 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:52:59,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.98 ms. Allocated memory is still 298.8 MB. Free memory was 257.7 MB in the beginning and 246.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:52:59,941 INFO L168 Benchmark]: Boogie Preprocessor took 40.60 ms. Allocated memory is still 298.8 MB. Free memory was 246.6 MB in the beginning and 244.6 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:52:59,941 INFO L168 Benchmark]: RCFGBuilder took 569.47 ms. Allocated memory is still 298.8 MB. Free memory was 244.6 MB in the beginning and 205.5 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 5.3 GB. [2018-01-28 21:52:59,941 INFO L168 Benchmark]: TraceAbstraction took 142688.90 ms. Allocated memory was 298.8 MB in the beginning and 601.9 MB in the end (delta: 303.0 MB). Free memory was 205.5 MB in the beginning and 308.2 MB in the end (delta: -102.7 MB). Peak memory consumption was 200.4 MB. Max. memory is 5.3 GB. [2018-01-28 21:52:59,943 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.12 ms. Allocated memory is still 298.8 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.98 ms. Allocated memory is still 298.8 MB. Free memory was 257.7 MB in the beginning and 246.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.60 ms. Allocated memory is still 298.8 MB. Free memory was 246.6 MB in the beginning and 244.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 569.47 ms. Allocated memory is still 298.8 MB. Free memory was 244.6 MB in the beginning and 205.5 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 142688.90 ms. Allocated memory was 298.8 MB in the beginning and 601.9 MB in the end (delta: 303.0 MB). Free memory was 205.5 MB in the beginning and 308.2 MB in the end (delta: -102.7 MB). Peak memory consumption was 200.4 MB. 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 663). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 78 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 0 conjuction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 179 locations, 55 error locations. TIMEOUT Result, 142.6s OverallTime, 28 OverallIterations, 3 TraceHistogramMax, 117.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4641 SDtfs, 11715 SDslu, 15649 SDs, 0 SdLazy, 8928 SolverSat, 577 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 35.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 608 GetRequests, 256 SyntacticMatches, 16 SemanticMatches, 336 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2739 ImplicationChecksByTransitivity, 100.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=553occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 3416 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 1343 NumberOfCodeBlocks, 1343 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1312 ConstructedInterpolants, 59 QuantifiedInterpolants, 824919 SizeOfPredicates, 58 NumberOfNonLiveVariables, 749 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 54/89 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/tree_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-52-59-953.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-52-59-953.csv Completed graceful shutdown