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/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:35:51,508 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:35:51,510 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:35:51,523 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:35:51,524 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:35:51,525 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:35:51,526 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:35:51,527 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:35:51,530 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:35:51,530 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:35:51,531 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:35:51,532 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:35:51,533 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:35:51,534 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:35:51,535 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:35:51,537 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:35:51,539 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:35:51,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:35:51,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:35:51,544 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:35:51,546 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:35:51,546 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:35:51,546 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:35:51,547 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:35:51,548 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:35:51,549 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:35:51,549 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:35:51,550 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:35:51,550 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:35:51,550 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:35:51,551 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:35:51,551 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-30 00:35:51,561 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:35:51,561 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:35:51,562 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:35:51,562 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:35:51,562 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:35:51,563 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:35:51,563 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:35:51,563 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:35:51,564 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:35:51,564 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:35:51,564 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:35:51,564 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:35:51,564 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:35:51,564 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:35:51,565 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:35:51,565 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:35:51,565 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:35:51,565 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:35:51,565 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:35:51,566 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:35:51,566 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:35:51,566 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:35:51,566 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:35:51,566 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:35:51,566 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:35:51,567 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:35:51,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:35:51,567 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:35:51,567 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:35:51,567 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:35:51,568 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:35:51,568 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:35:51,569 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:35:51,569 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:35:51,602 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:35:51,612 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:35:51,615 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:35:51,616 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:35:51,616 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:35:51,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-30 00:35:51,777 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:35:51,783 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:35:51,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:35:51,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:35:51,789 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:35:51,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:35:51" (1/1) ... [2018-01-30 00:35:51,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f53b356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:35:51, skipping insertion in model container [2018-01-30 00:35:51,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:35:51" (1/1) ... [2018-01-30 00:35:51,810 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:35:51,853 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:35:51,973 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:35:51,994 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:35:52,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:35:52 WrapperNode [2018-01-30 00:35:52,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:35:52,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:35:52,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:35:52,005 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:35:52,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:35:52" (1/1) ... [2018-01-30 00:35:52,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:35:52" (1/1) ... [2018-01-30 00:35:52,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:35:52" (1/1) ... [2018-01-30 00:35:52,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:35:52" (1/1) ... [2018-01-30 00:35:52,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:35:52" (1/1) ... [2018-01-30 00:35:52,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:35:52" (1/1) ... [2018-01-30 00:35:52,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:35:52" (1/1) ... [2018-01-30 00:35:52,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:35:52,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:35:52,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:35:52,044 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:35:52,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:35:52" (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-30 00:35:52,090 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:35:52,091 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:35:52,091 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:35:52,091 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:35:52,091 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:35:52,091 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 00:35:52,091 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 00:35:52,091 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:35:52,092 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:35:52,092 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:35:52,092 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:35:52,092 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:35:52,092 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:35:52,092 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:35:52,093 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:35:52,093 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:35:52,093 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:35:52,648 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:35:52,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:35:52 BoogieIcfgContainer [2018-01-30 00:35:52,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:35:52,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:35:52,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:35:52,653 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:35:52,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:35:51" (1/3) ... [2018-01-30 00:35:52,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e788c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:35:52, skipping insertion in model container [2018-01-30 00:35:52,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:35:52" (2/3) ... [2018-01-30 00:35:52,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e788c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:35:52, skipping insertion in model container [2018-01-30 00:35:52,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:35:52" (3/3) ... [2018-01-30 00:35:52,656 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-30 00:35:52,663 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:35:52,671 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-01-30 00:35:52,711 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:35:52,712 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:35:52,712 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:35:52,712 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:35:52,712 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:35:52,712 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:35:52,712 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:35:52,712 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:35:52,713 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:35:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states. [2018-01-30 00:35:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 00:35:52,738 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:35:52,739 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:35:52,739 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:35:52,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1465574683, now seen corresponding path program 1 times [2018-01-30 00:35:52,744 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:35:52,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:35:52,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:52,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:35:52,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:35:52,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:35:52,901 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-30 00:35:52,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:35:52,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:35:52,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:35:53,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:35:53,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:35:53,011 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 4 states. [2018-01-30 00:35:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:35:53,275 INFO L93 Difference]: Finished difference Result 289 states and 322 transitions. [2018-01-30 00:35:53,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:35:53,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-30 00:35:53,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:35:53,292 INFO L225 Difference]: With dead ends: 289 [2018-01-30 00:35:53,292 INFO L226 Difference]: Without dead ends: 185 [2018-01-30 00:35:53,297 INFO L553 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-30 00:35:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-30 00:35:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 160. [2018-01-30 00:35:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-30 00:35:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2018-01-30 00:35:53,348 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 9 [2018-01-30 00:35:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:35:53,349 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2018-01-30 00:35:53,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:35:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2018-01-30 00:35:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 00:35:53,349 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:35:53,350 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:35:53,350 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:35:53,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1465574682, now seen corresponding path program 1 times [2018-01-30 00:35:53,350 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:35:53,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:35:53,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:53,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:35:53,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:35:53,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:35:53,449 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-30 00:35:53,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:35:53,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:35:53,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:35:53,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:35:53,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:35:53,452 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand 4 states. [2018-01-30 00:35:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:35:53,617 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2018-01-30 00:35:53,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:35:53,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-30 00:35:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:35:53,620 INFO L225 Difference]: With dead ends: 166 [2018-01-30 00:35:53,622 INFO L226 Difference]: Without dead ends: 158 [2018-01-30 00:35:53,623 INFO L553 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-30 00:35:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-30 00:35:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-01-30 00:35:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-30 00:35:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2018-01-30 00:35:53,635 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 9 [2018-01-30 00:35:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:35:53,635 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2018-01-30 00:35:53,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:35:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2018-01-30 00:35:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-30 00:35:53,636 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:35:53,637 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:35:53,637 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:35:53,637 INFO L82 PathProgramCache]: Analyzing trace with hash -228304531, now seen corresponding path program 1 times [2018-01-30 00:35:53,637 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:35:53,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:35:53,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:53,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:35:53,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:35:53,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:35:53,727 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-30 00:35:53,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:35:53,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:35:53,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:35:53,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:35:53,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:35:53,728 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand 5 states. [2018-01-30 00:35:54,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:35:54,110 INFO L93 Difference]: Finished difference Result 331 states and 355 transitions. [2018-01-30 00:35:54,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:35:54,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-30 00:35:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:35:54,113 INFO L225 Difference]: With dead ends: 331 [2018-01-30 00:35:54,113 INFO L226 Difference]: Without dead ends: 330 [2018-01-30 00:35:54,114 INFO L553 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-30 00:35:54,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-01-30 00:35:54,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 151. [2018-01-30 00:35:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-30 00:35:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2018-01-30 00:35:54,128 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 17 [2018-01-30 00:35:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:35:54,129 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2018-01-30 00:35:54,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:35:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2018-01-30 00:35:54,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-30 00:35:54,130 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:35:54,130 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:35:54,131 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:35:54,131 INFO L82 PathProgramCache]: Analyzing trace with hash -228304530, now seen corresponding path program 1 times [2018-01-30 00:35:54,132 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:35:54,132 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:35:54,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:54,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:35:54,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:35:54,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:35:54,241 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-30 00:35:54,241 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:35:54,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:35:54,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:35:54,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:35:54,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:35:54,243 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand 5 states. [2018-01-30 00:35:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:35:54,605 INFO L93 Difference]: Finished difference Result 274 states and 294 transitions. [2018-01-30 00:35:54,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:35:54,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-30 00:35:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:35:54,608 INFO L225 Difference]: With dead ends: 274 [2018-01-30 00:35:54,608 INFO L226 Difference]: Without dead ends: 273 [2018-01-30 00:35:54,609 INFO L553 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-30 00:35:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-01-30 00:35:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 150. [2018-01-30 00:35:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-30 00:35:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 161 transitions. [2018-01-30 00:35:54,619 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 161 transitions. Word has length 17 [2018-01-30 00:35:54,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:35:54,620 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 161 transitions. [2018-01-30 00:35:54,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:35:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 161 transitions. [2018-01-30 00:35:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 00:35:54,620 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:35:54,620 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:35:54,620 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:35:54,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1558132488, now seen corresponding path program 1 times [2018-01-30 00:35:54,621 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:35:54,621 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:35:54,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:54,622 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:35:54,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:35:54,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:35:54,713 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-30 00:35:54,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:35:54,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:35:54,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:35:54,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:35:54,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:35:54,715 INFO L87 Difference]: Start difference. First operand 150 states and 161 transitions. Second operand 4 states. [2018-01-30 00:35:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:35:54,841 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2018-01-30 00:35:54,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:35:54,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-30 00:35:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:35:54,843 INFO L225 Difference]: With dead ends: 172 [2018-01-30 00:35:54,843 INFO L226 Difference]: Without dead ends: 156 [2018-01-30 00:35:54,843 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:35:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-30 00:35:54,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 148. [2018-01-30 00:35:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-30 00:35:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 164 transitions. [2018-01-30 00:35:54,853 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 164 transitions. Word has length 24 [2018-01-30 00:35:54,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:35:54,853 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 164 transitions. [2018-01-30 00:35:54,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:35:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 164 transitions. [2018-01-30 00:35:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 00:35:54,854 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:35:54,854 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:35:54,854 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:35:54,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1558132487, now seen corresponding path program 1 times [2018-01-30 00:35:54,854 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:35:54,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:35:54,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:54,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:35:54,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:35:54,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:35:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:35:54,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:35:54,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:35:54,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:35:54,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:35:54,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:35:54,940 INFO L87 Difference]: Start difference. First operand 148 states and 164 transitions. Second operand 5 states. [2018-01-30 00:35:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:35:55,114 INFO L93 Difference]: Finished difference Result 217 states and 235 transitions. [2018-01-30 00:35:55,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:35:55,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-30 00:35:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:35:55,116 INFO L225 Difference]: With dead ends: 217 [2018-01-30 00:35:55,116 INFO L226 Difference]: Without dead ends: 206 [2018-01-30 00:35:55,116 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:35:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-30 00:35:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 187. [2018-01-30 00:35:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-30 00:35:55,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 210 transitions. [2018-01-30 00:35:55,126 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 210 transitions. Word has length 24 [2018-01-30 00:35:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:35:55,126 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 210 transitions. [2018-01-30 00:35:55,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:35:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 210 transitions. [2018-01-30 00:35:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:35:55,127 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:35:55,127 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:35:55,127 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:35:55,128 INFO L82 PathProgramCache]: Analyzing trace with hash 590643644, now seen corresponding path program 1 times [2018-01-30 00:35:55,128 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:35:55,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:35:55,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:55,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:35:55,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:35:55,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:35:55,198 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-30 00:35:55,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:35:55,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:35:55,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:35:55,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:35:55,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:35:55,199 INFO L87 Difference]: Start difference. First operand 187 states and 210 transitions. Second operand 6 states. [2018-01-30 00:35:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:35:55,610 INFO L93 Difference]: Finished difference Result 274 states and 308 transitions. [2018-01-30 00:35:55,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:35:55,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-30 00:35:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:35:55,616 INFO L225 Difference]: With dead ends: 274 [2018-01-30 00:35:55,617 INFO L226 Difference]: Without dead ends: 273 [2018-01-30 00:35:55,617 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:35:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-01-30 00:35:55,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 186. [2018-01-30 00:35:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-30 00:35:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 209 transitions. [2018-01-30 00:35:55,629 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 209 transitions. Word has length 28 [2018-01-30 00:35:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:35:55,630 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 209 transitions. [2018-01-30 00:35:55,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:35:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 209 transitions. [2018-01-30 00:35:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:35:55,631 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:35:55,631 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:35:55,631 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:35:55,632 INFO L82 PathProgramCache]: Analyzing trace with hash 590643645, now seen corresponding path program 1 times [2018-01-30 00:35:55,632 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:35:55,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:35:55,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:55,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:35:55,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:35:55,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:35:55,773 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-30 00:35:55,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:35:55,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:35:55,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:35:55,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:35:55,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:35:55,774 INFO L87 Difference]: Start difference. First operand 186 states and 209 transitions. Second operand 6 states. [2018-01-30 00:35:56,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:35:56,192 INFO L93 Difference]: Finished difference Result 298 states and 338 transitions. [2018-01-30 00:35:56,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:35:56,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-30 00:35:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:35:56,194 INFO L225 Difference]: With dead ends: 298 [2018-01-30 00:35:56,194 INFO L226 Difference]: Without dead ends: 288 [2018-01-30 00:35:56,195 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:35:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-01-30 00:35:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 169. [2018-01-30 00:35:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-30 00:35:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 191 transitions. [2018-01-30 00:35:56,207 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 191 transitions. Word has length 28 [2018-01-30 00:35:56,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:35:56,207 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 191 transitions. [2018-01-30 00:35:56,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:35:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 191 transitions. [2018-01-30 00:35:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 00:35:56,208 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:35:56,209 INFO L350 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] [2018-01-30 00:35:56,209 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:35:56,209 INFO L82 PathProgramCache]: Analyzing trace with hash 609254421, now seen corresponding path program 1 times [2018-01-30 00:35:56,209 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:35:56,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:35:56,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:56,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:35:56,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:35:56,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:35:56,279 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-30 00:35:56,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:35:56,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:35:56,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:35:56,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:35:56,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:35:56,280 INFO L87 Difference]: Start difference. First operand 169 states and 191 transitions. Second operand 5 states. [2018-01-30 00:35:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:35:56,391 INFO L93 Difference]: Finished difference Result 233 states and 259 transitions. [2018-01-30 00:35:56,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:35:56,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-30 00:35:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:35:56,393 INFO L225 Difference]: With dead ends: 233 [2018-01-30 00:35:56,393 INFO L226 Difference]: Without dead ends: 190 [2018-01-30 00:35:56,394 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:35:56,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-30 00:35:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 169. [2018-01-30 00:35:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-30 00:35:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 189 transitions. [2018-01-30 00:35:56,405 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 189 transitions. Word has length 30 [2018-01-30 00:35:56,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:35:56,406 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 189 transitions. [2018-01-30 00:35:56,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:35:56,406 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 189 transitions. [2018-01-30 00:35:56,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 00:35:56,407 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:35:56,407 INFO L350 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-30 00:35:56,407 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:35:56,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2035272263, now seen corresponding path program 1 times [2018-01-30 00:35:56,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:35:56,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:35:56,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:56,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:35:56,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:35:56,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:35:56,470 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-30 00:35:56,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:35:56,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:35:56,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:35:56,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:35:56,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:35:56,472 INFO L87 Difference]: Start difference. First operand 169 states and 189 transitions. Second operand 4 states. [2018-01-30 00:35:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:35:56,499 INFO L93 Difference]: Finished difference Result 312 states and 351 transitions. [2018-01-30 00:35:56,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:35:56,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-01-30 00:35:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:35:56,501 INFO L225 Difference]: With dead ends: 312 [2018-01-30 00:35:56,501 INFO L226 Difference]: Without dead ends: 213 [2018-01-30 00:35:56,502 INFO L553 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-30 00:35:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-01-30 00:35:56,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 173. [2018-01-30 00:35:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-30 00:35:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 193 transitions. [2018-01-30 00:35:56,510 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 193 transitions. Word has length 33 [2018-01-30 00:35:56,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:35:56,511 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 193 transitions. [2018-01-30 00:35:56,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:35:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 193 transitions. [2018-01-30 00:35:56,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:35:56,512 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:35:56,512 INFO L350 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-30 00:35:56,512 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:35:56,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1371399670, now seen corresponding path program 1 times [2018-01-30 00:35:56,513 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:35:56,513 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:35:56,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:56,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:35:56,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:35:56,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:35:56,632 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-30 00:35:56,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:35:56,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:35:56,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:35:56,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:35:56,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:35:56,633 INFO L87 Difference]: Start difference. First operand 173 states and 193 transitions. Second operand 8 states. [2018-01-30 00:35:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:35:56,963 INFO L93 Difference]: Finished difference Result 335 states and 370 transitions. [2018-01-30 00:35:56,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:35:56,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-30 00:35:56,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:35:56,966 INFO L225 Difference]: With dead ends: 335 [2018-01-30 00:35:56,966 INFO L226 Difference]: Without dead ends: 334 [2018-01-30 00:35:56,967 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-01-30 00:35:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-30 00:35:56,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 191. [2018-01-30 00:35:56,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-30 00:35:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 215 transitions. [2018-01-30 00:35:56,983 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 215 transitions. Word has length 35 [2018-01-30 00:35:56,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:35:56,983 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 215 transitions. [2018-01-30 00:35:56,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:35:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 215 transitions. [2018-01-30 00:35:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:35:56,985 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:35:56,985 INFO L350 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-30 00:35:56,985 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:35:56,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1371399671, now seen corresponding path program 1 times [2018-01-30 00:35:56,985 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:35:56,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:35:56,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:56,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:35:56,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:35:56,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:35:57,255 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-30 00:35:57,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:35:57,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:35:57,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:35:57,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:35:57,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:35:57,257 INFO L87 Difference]: Start difference. First operand 191 states and 215 transitions. Second operand 9 states. [2018-01-30 00:35:57,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:35:57,828 INFO L93 Difference]: Finished difference Result 387 states and 429 transitions. [2018-01-30 00:35:57,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:35:57,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-30 00:35:57,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:35:57,830 INFO L225 Difference]: With dead ends: 387 [2018-01-30 00:35:57,830 INFO L226 Difference]: Without dead ends: 286 [2018-01-30 00:35:57,831 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-01-30 00:35:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-01-30 00:35:57,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 187. [2018-01-30 00:35:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-30 00:35:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 209 transitions. [2018-01-30 00:35:57,845 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 209 transitions. Word has length 35 [2018-01-30 00:35:57,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:35:57,845 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 209 transitions. [2018-01-30 00:35:57,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:35:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 209 transitions. [2018-01-30 00:35:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:35:57,846 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:35:57,846 INFO L350 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] [2018-01-30 00:35:57,847 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:35:57,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1356259716, now seen corresponding path program 1 times [2018-01-30 00:35:57,847 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:35:57,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:35:57,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:57,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:35:57,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:35:57,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:35:57,961 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-30 00:35:57,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:35:57,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:35:57,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:35:57,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:35:57,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:35:57,962 INFO L87 Difference]: Start difference. First operand 187 states and 209 transitions. Second operand 9 states. [2018-01-30 00:35:58,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:35:58,602 INFO L93 Difference]: Finished difference Result 543 states and 599 transitions. [2018-01-30 00:35:58,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:35:58,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-01-30 00:35:58,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:35:58,605 INFO L225 Difference]: With dead ends: 543 [2018-01-30 00:35:58,605 INFO L226 Difference]: Without dead ends: 542 [2018-01-30 00:35:58,606 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:35:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-01-30 00:35:58,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 204. [2018-01-30 00:35:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-30 00:35:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 230 transitions. [2018-01-30 00:35:58,623 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 230 transitions. Word has length 36 [2018-01-30 00:35:58,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:35:58,623 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 230 transitions. [2018-01-30 00:35:58,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:35:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 230 transitions. [2018-01-30 00:35:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:35:58,624 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:35:58,624 INFO L350 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] [2018-01-30 00:35:58,624 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:35:58,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1356259717, now seen corresponding path program 1 times [2018-01-30 00:35:58,624 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:35:58,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:35:58,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:58,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:35:58,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:35:58,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:35:59,004 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-30 00:35:59,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:35:59,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-30 00:35:59,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:35:59,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:35:59,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:35:59,005 INFO L87 Difference]: Start difference. First operand 204 states and 230 transitions. Second operand 11 states. [2018-01-30 00:35:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:35:59,838 INFO L93 Difference]: Finished difference Result 411 states and 455 transitions. [2018-01-30 00:35:59,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:35:59,839 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-01-30 00:35:59,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:35:59,841 INFO L225 Difference]: With dead ends: 411 [2018-01-30 00:35:59,841 INFO L226 Difference]: Without dead ends: 410 [2018-01-30 00:35:59,842 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:35:59,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-01-30 00:35:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 204. [2018-01-30 00:35:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-30 00:35:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 229 transitions. [2018-01-30 00:35:59,859 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 229 transitions. Word has length 36 [2018-01-30 00:35:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:35:59,860 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 229 transitions. [2018-01-30 00:35:59,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:35:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 229 transitions. [2018-01-30 00:35:59,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:35:59,861 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:35:59,861 INFO L350 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] [2018-01-30 00:35:59,861 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:35:59,861 INFO L82 PathProgramCache]: Analyzing trace with hash -216978492, now seen corresponding path program 1 times [2018-01-30 00:35:59,861 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:35:59,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:35:59,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:59,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:35:59,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:35:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:35:59,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:35:59,907 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-30 00:35:59,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:35:59,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:35:59,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:35:59,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:35:59,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:35:59,908 INFO L87 Difference]: Start difference. First operand 204 states and 229 transitions. Second operand 5 states. [2018-01-30 00:36:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:36:00,124 INFO L93 Difference]: Finished difference Result 331 states and 370 transitions. [2018-01-30 00:36:00,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:36:00,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-30 00:36:00,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:36:00,125 INFO L225 Difference]: With dead ends: 331 [2018-01-30 00:36:00,125 INFO L226 Difference]: Without dead ends: 330 [2018-01-30 00:36:00,125 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-30 00:36:00,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-01-30 00:36:00,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 203. [2018-01-30 00:36:00,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-30 00:36:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 228 transitions. [2018-01-30 00:36:00,136 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 228 transitions. Word has length 36 [2018-01-30 00:36:00,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:36:00,136 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 228 transitions. [2018-01-30 00:36:00,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:36:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 228 transitions. [2018-01-30 00:36:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:36:00,137 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:36:00,137 INFO L350 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] [2018-01-30 00:36:00,137 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:36:00,137 INFO L82 PathProgramCache]: Analyzing trace with hash -216978491, now seen corresponding path program 1 times [2018-01-30 00:36:00,137 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:36:00,138 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:36:00,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:36:00,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:36:00,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:36:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:36:00,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:36:00,225 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-30 00:36:00,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:36:00,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:36:00,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:36:00,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:36:00,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:36:00,227 INFO L87 Difference]: Start difference. First operand 203 states and 228 transitions. Second operand 5 states. [2018-01-30 00:36:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:36:00,443 INFO L93 Difference]: Finished difference Result 342 states and 385 transitions. [2018-01-30 00:36:00,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:36:00,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-30 00:36:00,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:36:00,444 INFO L225 Difference]: With dead ends: 342 [2018-01-30 00:36:00,444 INFO L226 Difference]: Without dead ends: 341 [2018-01-30 00:36:00,445 INFO L553 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-30 00:36:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-01-30 00:36:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 202. [2018-01-30 00:36:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-01-30 00:36:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 227 transitions. [2018-01-30 00:36:00,460 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 227 transitions. Word has length 36 [2018-01-30 00:36:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:36:00,461 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 227 transitions. [2018-01-30 00:36:00,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:36:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 227 transitions. [2018-01-30 00:36:00,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-30 00:36:00,462 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:36:00,462 INFO L350 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] [2018-01-30 00:36:00,462 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:36:00,462 INFO L82 PathProgramCache]: Analyzing trace with hash 672602829, now seen corresponding path program 1 times [2018-01-30 00:36:00,463 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:36:00,463 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:36:00,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:36:00,464 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:36:00,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:36:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:36:00,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:36:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:36:00,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:36:00,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:36:00,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:36:00,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:36:00,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:36:00,504 INFO L87 Difference]: Start difference. First operand 202 states and 227 transitions. Second operand 4 states. [2018-01-30 00:36:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:36:00,532 INFO L93 Difference]: Finished difference Result 319 states and 356 transitions. [2018-01-30 00:36:00,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:36:00,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-01-30 00:36:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:36:00,534 INFO L225 Difference]: With dead ends: 319 [2018-01-30 00:36:00,534 INFO L226 Difference]: Without dead ends: 225 [2018-01-30 00:36:00,534 INFO L553 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-30 00:36:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-30 00:36:00,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2018-01-30 00:36:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-30 00:36:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 231 transitions. [2018-01-30 00:36:00,549 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 231 transitions. Word has length 50 [2018-01-30 00:36:00,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:36:00,549 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 231 transitions. [2018-01-30 00:36:00,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:36:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 231 transitions. [2018-01-30 00:36:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-30 00:36:00,550 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:36:00,551 INFO L350 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] [2018-01-30 00:36:00,551 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:36:00,551 INFO L82 PathProgramCache]: Analyzing trace with hash 634806536, now seen corresponding path program 1 times [2018-01-30 00:36:00,551 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:36:00,551 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:36:00,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:36:00,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:36:00,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:36:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:36:00,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:36:00,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:36:00,708 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:36:00,708 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-30 00:36:00,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:36:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:36:00,764 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:36:00,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:36:00,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:36:00,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:00,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:00,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:36:00,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:36:00,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:00,916 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:00,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:00,922 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-01-30 00:36:00,963 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 27 treesize of output 22 [2018-01-30 00:36:00,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:36:00,994 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 22 treesize of output 14 [2018-01-30 00:36:00,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:01,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:01,014 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 27 treesize of output 22 [2018-01-30 00:36:01,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:36:01,021 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 22 treesize of output 14 [2018-01-30 00:36:01,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:01,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:01,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:01,033 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:18 [2018-01-30 00:36:01,045 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-30 00:36:01,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:36:01,051 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-30 00:36:01,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:01,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:01,082 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-30 00:36:01,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:36:01,086 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-30 00:36:01,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:01,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:01,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:01,106 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:36 [2018-01-30 00:36:01,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 00:36:01,157 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 16 treesize of output 3 [2018-01-30 00:36:01,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:01,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:01,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 00:36:01,172 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 16 treesize of output 3 [2018-01-30 00:36:01,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:01,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:01,178 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-30 00:36:01,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-01-30 00:36:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:36:01,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:36:01,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-01-30 00:36:01,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:36:01,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:36:01,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:36:01,244 INFO L87 Difference]: Start difference. First operand 206 states and 231 transitions. Second operand 11 states. [2018-01-30 00:36:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:36:02,206 INFO L93 Difference]: Finished difference Result 392 states and 432 transitions. [2018-01-30 00:36:02,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 00:36:02,206 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-01-30 00:36:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:36:02,208 INFO L225 Difference]: With dead ends: 392 [2018-01-30 00:36:02,208 INFO L226 Difference]: Without dead ends: 307 [2018-01-30 00:36:02,209 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2018-01-30 00:36:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-01-30 00:36:02,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 230. [2018-01-30 00:36:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-30 00:36:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 256 transitions. [2018-01-30 00:36:02,229 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 256 transitions. Word has length 52 [2018-01-30 00:36:02,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:36:02,230 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 256 transitions. [2018-01-30 00:36:02,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:36:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 256 transitions. [2018-01-30 00:36:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-30 00:36:02,230 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:36:02,231 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:36:02,231 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:36:02,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2094775915, now seen corresponding path program 1 times [2018-01-30 00:36:02,231 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:36:02,231 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:36:02,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:36:02,232 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:36:02,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:36:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:36:02,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:36:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:36:02,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:36:02,743 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-30 00:36:02,748 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:36:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:36:02,784 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:36:02,810 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-30 00:36:02,814 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-30 00:36:02,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:02,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:02,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:02,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-30 00:36:02,853 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 29 treesize of output 24 [2018-01-30 00:36:02,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:36:02,859 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 24 treesize of output 18 [2018-01-30 00:36:02,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:02,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:02,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:02,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:18 [2018-01-30 00:36:02,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:36:02,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:36:02,905 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-30 00:36:02,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:02,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:02,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-01-30 00:36:02,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:36:02,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-01-30 00:36:02,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:02,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-01-30 00:36:03,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:36:03,009 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 20 treesize of output 27 [2018-01-30 00:36:03,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,025 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-30 00:36:03,025 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:27 [2018-01-30 00:36:03,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-30 00:36:03,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-30 00:36:03,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:17 [2018-01-30 00:36:03,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-30 00:36:03,089 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 1 [2018-01-30 00:36:03,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-01-30 00:36:03,101 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 23 treesize of output 24 [2018-01-30 00:36:03,103 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-30 00:36:03,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-01-30 00:36:03,150 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 38 treesize of output 37 [2018-01-30 00:36:03,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:36:03,154 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 24 treesize of output 18 [2018-01-30 00:36:03,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 00:36:03,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:26 [2018-01-30 00:36:03,238 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-30 00:36:03,242 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-30 00:36:03,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,251 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-30 00:36:03,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:36:03,260 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-01-30 00:36:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:36:03,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:36:03,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2018-01-30 00:36:03,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 00:36:03,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 00:36:03,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2018-01-30 00:36:03,322 INFO L87 Difference]: Start difference. First operand 230 states and 256 transitions. Second operand 27 states. [2018-01-30 00:36:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:36:05,952 INFO L93 Difference]: Finished difference Result 897 states and 965 transitions. [2018-01-30 00:36:05,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-30 00:36:05,953 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2018-01-30 00:36:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:36:05,956 INFO L225 Difference]: With dead ends: 897 [2018-01-30 00:36:05,956 INFO L226 Difference]: Without dead ends: 765 [2018-01-30 00:36:05,958 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=859, Invalid=3971, Unknown=0, NotChecked=0, Total=4830 [2018-01-30 00:36:05,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-01-30 00:36:05,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 306. [2018-01-30 00:36:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-01-30 00:36:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 342 transitions. [2018-01-30 00:36:05,986 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 342 transitions. Word has length 53 [2018-01-30 00:36:05,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:36:05,987 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 342 transitions. [2018-01-30 00:36:05,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 00:36:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 342 transitions. [2018-01-30 00:36:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-30 00:36:05,988 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:36:05,988 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:36:05,988 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:36:05,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1161832278, now seen corresponding path program 1 times [2018-01-30 00:36:05,989 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:36:05,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:36:05,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:36:05,990 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:36:05,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:36:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:36:06,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:36:06,131 ERROR L119 erpolLogProxyWrapper]: Could not assert interpolant [2018-01-30 00:36:06,131 ERROR L119 erpolLogProxyWrapper]: Interpolant 22 not inductive: (Check returned sat) [2018-01-30 00:36:06,132 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Asserted terms must be closed at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:956) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-30 00:36:06,136 INFO L168 Benchmark]: Toolchain (without parser) took 14358.50 ms. Allocated memory was 305.7 MB in the beginning and 639.1 MB in the end (delta: 333.4 MB). Free memory was 264.5 MB in the beginning and 490.6 MB in the end (delta: -226.1 MB). Peak memory consumption was 107.4 MB. Max. memory is 5.3 GB. [2018-01-30 00:36:06,138 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:36:06,138 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.62 ms. Allocated memory is still 305.7 MB. Free memory was 264.5 MB in the beginning and 252.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:36:06,138 INFO L168 Benchmark]: Boogie Preprocessor took 38.20 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 250.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:36:06,138 INFO L168 Benchmark]: RCFGBuilder took 604.97 ms. Allocated memory is still 305.7 MB. Free memory was 250.6 MB in the beginning and 209.7 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 5.3 GB. [2018-01-30 00:36:06,139 INFO L168 Benchmark]: TraceAbstraction took 13485.91 ms. Allocated memory was 305.7 MB in the beginning and 639.1 MB in the end (delta: 333.4 MB). Free memory was 207.7 MB in the beginning and 490.6 MB in the end (delta: -282.9 MB). Peak memory consumption was 50.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:36:06,140 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 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.62 ms. Allocated memory is still 305.7 MB. Free memory was 264.5 MB in the beginning and 252.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.20 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 250.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 604.97 ms. Allocated memory is still 305.7 MB. Free memory was 250.6 MB in the beginning and 209.7 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 13485.91 ms. Allocated memory was 305.7 MB in the beginning and 639.1 MB in the end (delta: 333.4 MB). Free memory was 207.7 MB in the beginning and 490.6 MB in the end (delta: -282.9 MB). Peak memory consumption was 50.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Asserted terms must be closed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Asserted terms must be closed: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-36-06-147.csv Received shutdown request...