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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 05:36:32,701 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 05:36:32,702 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 05:36:32,712 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 05:36:32,712 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 05:36:32,712 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 05:36:32,713 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 05:36:32,714 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 05:36:32,715 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 05:36:32,715 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 05:36:32,716 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 05:36:32,716 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 05:36:32,716 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 05:36:32,717 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 05:36:32,717 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 05:36:32,719 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 05:36:32,720 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 05:36:32,720 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 05:36:32,721 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 05:36:32,722 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 05:36:32,723 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 05:36:32,723 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 05:36:32,723 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 05:36:32,724 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 05:36:32,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 05:36:32,725 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 05:36:32,725 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 05:36:32,725 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 05:36:32,725 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 05:36:32,725 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 05:36:32,726 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 05:36:32,726 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 05:36:32,733 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 05:36:32,733 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 05:36:32,733 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 05:36:32,734 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 05:36:32,734 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 05:36:32,734 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 05:36:32,734 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 05:36:32,734 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 05:36:32,734 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 05:36:32,734 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 05:36:32,735 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 05:36:32,735 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 05:36:32,735 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 05:36:32,735 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 05:36:32,735 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 05:36:32,735 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 05:36:32,735 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 05:36:32,735 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 05:36:32,735 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 05:36:32,735 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 05:36:32,735 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 05:36:32,736 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 05:36:32,736 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 05:36:32,736 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 05:36:32,736 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 05:36:32,736 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 05:36:32,736 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 05:36:32,736 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 05:36:32,736 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 05:36:32,736 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 05:36:32,736 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 05:36:32,736 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 05:36:32,737 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 05:36:32,737 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 05:36:32,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 05:36:32,761 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 05:36:32,763 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 05:36:32,764 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 05:36:32,764 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 05:36:32,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-01-30 05:36:32,837 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 05:36:32,838 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 05:36:32,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 05:36:32,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 05:36:32,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 05:36:32,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:36:32" (1/1) ... [2018-01-30 05:36:32,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38dc8e28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:36:32, skipping insertion in model container [2018-01-30 05:36:32,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:36:32" (1/1) ... [2018-01-30 05:36:32,854 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:36:32,865 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:36:32,943 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:36:32,956 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:36:32,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:36:32 WrapperNode [2018-01-30 05:36:32,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 05:36:32,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 05:36:32,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 05:36:32,962 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 05:36:32,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:36:32" (1/1) ... [2018-01-30 05:36:32,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:36:32" (1/1) ... [2018-01-30 05:36:32,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:36:32" (1/1) ... [2018-01-30 05:36:32,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:36:32" (1/1) ... [2018-01-30 05:36:32,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:36:32" (1/1) ... [2018-01-30 05:36:32,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:36:32" (1/1) ... [2018-01-30 05:36:32,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:36:32" (1/1) ... [2018-01-30 05:36:32,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 05:36:32,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 05:36:32,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 05:36:32,984 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 05:36:32,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:36:32" (1/1) ... No working directory specified, using /home/daniel/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 05:36:33,027 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 05:36:33,028 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 05:36:33,028 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 05:36:33,028 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 05:36:33,028 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 05:36:33,028 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 05:36:33,028 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 05:36:33,028 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 05:36:33,476 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 05:36:33,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:36:33 BoogieIcfgContainer [2018-01-30 05:36:33,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 05:36:33,477 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 05:36:33,478 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 05:36:33,478 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 05:36:33,480 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:36:33" (1/1) ... [2018-01-30 05:36:33,482 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 05:36:33,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:36:33 BasicIcfg [2018-01-30 05:36:33,491 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 05:36:33,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 05:36:33,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 05:36:33,493 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 05:36:33,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 05:36:32" (1/4) ... [2018-01-30 05:36:33,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b752973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:36:33, skipping insertion in model container [2018-01-30 05:36:33,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:36:32" (2/4) ... [2018-01-30 05:36:33,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b752973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:36:33, skipping insertion in model container [2018-01-30 05:36:33,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:36:33" (3/4) ... [2018-01-30 05:36:33,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b752973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:36:33, skipping insertion in model container [2018-01-30 05:36:33,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:36:33" (4/4) ... [2018-01-30 05:36:33,498 INFO L107 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.cleft_unchanged_by_heapseparator [2018-01-30 05:36:33,503 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 05:36:33,508 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 05:36:33,532 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 05:36:33,532 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 05:36:33,532 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 05:36:33,532 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 05:36:33,532 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 05:36:33,532 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 05:36:33,532 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 05:36:33,532 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 05:36:33,533 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 05:36:33,542 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-01-30 05:36:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-30 05:36:33,547 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:33,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:33,548 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation]=== [2018-01-30 05:36:33,550 INFO L82 PathProgramCache]: Analyzing trace with hash 229637440, now seen corresponding path program 1 times [2018-01-30 05:36:33,551 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:33,552 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:33,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:33,587 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:33,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:33,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:33,712 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 05:36:33,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:33,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:33,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:33,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:33,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:33,724 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2018-01-30 05:36:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:33,801 INFO L93 Difference]: Finished difference Result 262 states and 358 transitions. [2018-01-30 05:36:33,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:33,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-01-30 05:36:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:33,812 INFO L225 Difference]: With dead ends: 262 [2018-01-30 05:36:33,812 INFO L226 Difference]: Without dead ends: 178 [2018-01-30 05:36:33,814 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:33,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-30 05:36:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-01-30 05:36:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-30 05:36:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 232 transitions. [2018-01-30 05:36:33,926 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 232 transitions. Word has length 74 [2018-01-30 05:36:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:33,926 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 232 transitions. [2018-01-30 05:36:33,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 232 transitions. [2018-01-30 05:36:33,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-30 05:36:33,929 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:33,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:33,930 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation]=== [2018-01-30 05:36:33,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1637928375, now seen corresponding path program 1 times [2018-01-30 05:36:33,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:33,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:33,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:33,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:33,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:33,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:33,994 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 05:36:33,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:33,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:33,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:33,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:33,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:33,996 INFO L87 Difference]: Start difference. First operand 176 states and 232 transitions. Second operand 3 states. [2018-01-30 05:36:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:34,068 INFO L93 Difference]: Finished difference Result 214 states and 286 transitions. [2018-01-30 05:36:34,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:34,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-01-30 05:36:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:34,071 INFO L225 Difference]: With dead ends: 214 [2018-01-30 05:36:34,071 INFO L226 Difference]: Without dead ends: 212 [2018-01-30 05:36:34,071 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-30 05:36:34,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 176. [2018-01-30 05:36:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-30 05:36:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 231 transitions. [2018-01-30 05:36:34,083 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 231 transitions. Word has length 75 [2018-01-30 05:36:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:34,083 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 231 transitions. [2018-01-30 05:36:34,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:34,083 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 231 transitions. [2018-01-30 05:36:34,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-30 05:36:34,088 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:34,088 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:34,088 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation]=== [2018-01-30 05:36:34,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1471142044, now seen corresponding path program 1 times [2018-01-30 05:36:34,088 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:34,088 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:34,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:34,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:34,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:34,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:34,144 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 05:36:34,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:34,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:34,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:34,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:34,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:34,145 INFO L87 Difference]: Start difference. First operand 176 states and 231 transitions. Second operand 3 states. [2018-01-30 05:36:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:34,186 INFO L93 Difference]: Finished difference Result 432 states and 595 transitions. [2018-01-30 05:36:34,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:34,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-01-30 05:36:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:34,188 INFO L225 Difference]: With dead ends: 432 [2018-01-30 05:36:34,188 INFO L226 Difference]: Without dead ends: 301 [2018-01-30 05:36:34,189 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:34,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-01-30 05:36:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2018-01-30 05:36:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-01-30 05:36:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 404 transitions. [2018-01-30 05:36:34,199 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 404 transitions. Word has length 75 [2018-01-30 05:36:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:34,200 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 404 transitions. [2018-01-30 05:36:34,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 404 transitions. [2018-01-30 05:36:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-30 05:36:34,201 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:34,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:34,201 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation]=== [2018-01-30 05:36:34,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1472450012, now seen corresponding path program 1 times [2018-01-30 05:36:34,201 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:34,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:34,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:34,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:34,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:34,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:34,260 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 05:36:34,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:34,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:34,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:34,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:34,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:34,261 INFO L87 Difference]: Start difference. First operand 299 states and 404 transitions. Second operand 3 states. [2018-01-30 05:36:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:34,303 INFO L93 Difference]: Finished difference Result 367 states and 502 transitions. [2018-01-30 05:36:34,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:34,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-01-30 05:36:34,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:34,304 INFO L225 Difference]: With dead ends: 367 [2018-01-30 05:36:34,305 INFO L226 Difference]: Without dead ends: 365 [2018-01-30 05:36:34,305 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:34,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-01-30 05:36:34,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 299. [2018-01-30 05:36:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-01-30 05:36:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 402 transitions. [2018-01-30 05:36:34,314 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 402 transitions. Word has length 76 [2018-01-30 05:36:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:34,314 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 402 transitions. [2018-01-30 05:36:34,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 402 transitions. [2018-01-30 05:36:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-30 05:36:34,315 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:34,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:34,315 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation]=== [2018-01-30 05:36:34,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1639268986, now seen corresponding path program 1 times [2018-01-30 05:36:34,316 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:34,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:34,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:34,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:34,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:34,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:34,357 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 05:36:34,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:34,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:34,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:34,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:34,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:34,358 INFO L87 Difference]: Start difference. First operand 299 states and 402 transitions. Second operand 3 states. [2018-01-30 05:36:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:34,400 INFO L93 Difference]: Finished difference Result 795 states and 1100 transitions. [2018-01-30 05:36:34,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:34,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-01-30 05:36:34,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:34,402 INFO L225 Difference]: With dead ends: 795 [2018-01-30 05:36:34,402 INFO L226 Difference]: Without dead ends: 541 [2018-01-30 05:36:34,403 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-01-30 05:36:34,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 539. [2018-01-30 05:36:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-01-30 05:36:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 734 transitions. [2018-01-30 05:36:34,423 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 734 transitions. Word has length 76 [2018-01-30 05:36:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:34,423 INFO L432 AbstractCegarLoop]: Abstraction has 539 states and 734 transitions. [2018-01-30 05:36:34,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 734 transitions. [2018-01-30 05:36:34,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-30 05:36:34,425 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:34,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:34,428 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation]=== [2018-01-30 05:36:34,428 INFO L82 PathProgramCache]: Analyzing trace with hash -890067613, now seen corresponding path program 1 times [2018-01-30 05:36:34,428 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:34,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:34,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:34,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:34,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:34,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:34,465 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 05:36:34,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:34,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:34,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:34,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:34,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:34,466 INFO L87 Difference]: Start difference. First operand 539 states and 734 transitions. Second operand 3 states. [2018-01-30 05:36:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:34,494 INFO L93 Difference]: Finished difference Result 663 states and 912 transitions. [2018-01-30 05:36:34,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:34,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-01-30 05:36:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:34,496 INFO L225 Difference]: With dead ends: 663 [2018-01-30 05:36:34,496 INFO L226 Difference]: Without dead ends: 661 [2018-01-30 05:36:34,497 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-01-30 05:36:34,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 539. [2018-01-30 05:36:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-01-30 05:36:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 730 transitions. [2018-01-30 05:36:34,505 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 730 transitions. Word has length 77 [2018-01-30 05:36:34,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:34,505 INFO L432 AbstractCegarLoop]: Abstraction has 539 states and 730 transitions. [2018-01-30 05:36:34,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 730 transitions. [2018-01-30 05:36:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-30 05:36:34,506 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:34,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:34,506 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation]=== [2018-01-30 05:36:34,506 INFO L82 PathProgramCache]: Analyzing trace with hash -722236737, now seen corresponding path program 1 times [2018-01-30 05:36:34,506 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:34,506 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:34,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:34,507 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:34,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:34,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:34,561 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 05:36:34,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:34,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:34,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:34,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:34,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:34,562 INFO L87 Difference]: Start difference. First operand 539 states and 730 transitions. Second operand 3 states. [2018-01-30 05:36:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:34,606 INFO L93 Difference]: Finished difference Result 1503 states and 2068 transitions. [2018-01-30 05:36:34,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:34,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-01-30 05:36:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:34,608 INFO L225 Difference]: With dead ends: 1503 [2018-01-30 05:36:34,608 INFO L226 Difference]: Without dead ends: 1009 [2018-01-30 05:36:34,609 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-01-30 05:36:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1007. [2018-01-30 05:36:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2018-01-30 05:36:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1366 transitions. [2018-01-30 05:36:34,629 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1366 transitions. Word has length 77 [2018-01-30 05:36:34,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:34,629 INFO L432 AbstractCegarLoop]: Abstraction has 1007 states and 1366 transitions. [2018-01-30 05:36:34,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:34,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1366 transitions. [2018-01-30 05:36:34,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-30 05:36:34,630 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:34,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:34,634 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation]=== [2018-01-30 05:36:34,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1113669801, now seen corresponding path program 1 times [2018-01-30 05:36:34,634 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:34,634 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:34,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:34,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:34,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:34,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:34,709 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 05:36:34,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:34,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:34,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:34,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:34,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:34,710 INFO L87 Difference]: Start difference. First operand 1007 states and 1366 transitions. Second operand 3 states. [2018-01-30 05:36:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:34,778 INFO L93 Difference]: Finished difference Result 1235 states and 1688 transitions. [2018-01-30 05:36:34,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:34,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-01-30 05:36:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:34,781 INFO L225 Difference]: With dead ends: 1235 [2018-01-30 05:36:34,781 INFO L226 Difference]: Without dead ends: 1233 [2018-01-30 05:36:34,781 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:34,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-01-30 05:36:34,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1007. [2018-01-30 05:36:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2018-01-30 05:36:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1358 transitions. [2018-01-30 05:36:34,795 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1358 transitions. Word has length 78 [2018-01-30 05:36:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:34,795 INFO L432 AbstractCegarLoop]: Abstraction has 1007 states and 1358 transitions. [2018-01-30 05:36:34,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1358 transitions. [2018-01-30 05:36:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-30 05:36:34,796 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:34,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:34,796 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation]=== [2018-01-30 05:36:34,796 INFO L82 PathProgramCache]: Analyzing trace with hash -914469963, now seen corresponding path program 1 times [2018-01-30 05:36:34,797 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:34,797 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:34,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:34,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:34,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:34,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:34,869 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 05:36:34,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:34,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:34,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:34,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:34,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:34,870 INFO L87 Difference]: Start difference. First operand 1007 states and 1358 transitions. Second operand 3 states. [2018-01-30 05:36:34,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:34,975 INFO L93 Difference]: Finished difference Result 2883 states and 3920 transitions. [2018-01-30 05:36:34,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:34,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-01-30 05:36:34,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:34,979 INFO L225 Difference]: With dead ends: 2883 [2018-01-30 05:36:34,980 INFO L226 Difference]: Without dead ends: 1921 [2018-01-30 05:36:34,981 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2018-01-30 05:36:35,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1919. [2018-01-30 05:36:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1919 states. [2018-01-30 05:36:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 2574 transitions. [2018-01-30 05:36:35,005 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 2574 transitions. Word has length 78 [2018-01-30 05:36:35,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:35,005 INFO L432 AbstractCegarLoop]: Abstraction has 1919 states and 2574 transitions. [2018-01-30 05:36:35,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:35,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2574 transitions. [2018-01-30 05:36:35,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-30 05:36:35,006 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:35,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:35,006 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation]=== [2018-01-30 05:36:35,007 INFO L82 PathProgramCache]: Analyzing trace with hash 544597118, now seen corresponding path program 1 times [2018-01-30 05:36:35,007 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:35,007 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:35,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:35,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:35,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:35,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:35,076 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 05:36:35,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:35,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:35,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:35,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:35,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:35,077 INFO L87 Difference]: Start difference. First operand 1919 states and 2574 transitions. Second operand 3 states. [2018-01-30 05:36:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:35,146 INFO L93 Difference]: Finished difference Result 2339 states and 3152 transitions. [2018-01-30 05:36:35,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:35,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-01-30 05:36:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:35,150 INFO L225 Difference]: With dead ends: 2339 [2018-01-30 05:36:35,150 INFO L226 Difference]: Without dead ends: 2337 [2018-01-30 05:36:35,151 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:35,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2018-01-30 05:36:35,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1919. [2018-01-30 05:36:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1919 states. [2018-01-30 05:36:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 2558 transitions. [2018-01-30 05:36:35,176 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 2558 transitions. Word has length 79 [2018-01-30 05:36:35,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:35,176 INFO L432 AbstractCegarLoop]: Abstraction has 1919 states and 2558 transitions. [2018-01-30 05:36:35,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2558 transitions. [2018-01-30 05:36:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-30 05:36:35,177 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:35,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:35,178 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation]=== [2018-01-30 05:36:35,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1716234778, now seen corresponding path program 1 times [2018-01-30 05:36:35,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:35,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:35,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:35,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:35,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:35,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:35,242 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 05:36:35,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:35,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:35,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:35,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:35,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:35,243 INFO L87 Difference]: Start difference. First operand 1919 states and 2558 transitions. Second operand 3 states. [2018-01-30 05:36:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:35,344 INFO L93 Difference]: Finished difference Result 5571 states and 7456 transitions. [2018-01-30 05:36:35,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:35,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-01-30 05:36:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:35,351 INFO L225 Difference]: With dead ends: 5571 [2018-01-30 05:36:35,351 INFO L226 Difference]: Without dead ends: 3697 [2018-01-30 05:36:35,354 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2018-01-30 05:36:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3695. [2018-01-30 05:36:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3695 states. [2018-01-30 05:36:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 3695 states and 4878 transitions. [2018-01-30 05:36:35,428 INFO L78 Accepts]: Start accepts. Automaton has 3695 states and 4878 transitions. Word has length 79 [2018-01-30 05:36:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:35,428 INFO L432 AbstractCegarLoop]: Abstraction has 3695 states and 4878 transitions. [2018-01-30 05:36:35,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3695 states and 4878 transitions. [2018-01-30 05:36:35,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-30 05:36:35,430 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:35,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:35,430 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation]=== [2018-01-30 05:36:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash 411264210, now seen corresponding path program 1 times [2018-01-30 05:36:35,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:35,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:35,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:35,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:35,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:35,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:35,489 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 05:36:35,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:35,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:35,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:35,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:35,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:35,490 INFO L87 Difference]: Start difference. First operand 3695 states and 4878 transitions. Second operand 3 states. [2018-01-30 05:36:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:35,563 INFO L93 Difference]: Finished difference Result 4467 states and 5904 transitions. [2018-01-30 05:36:35,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:35,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-01-30 05:36:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:35,571 INFO L225 Difference]: With dead ends: 4467 [2018-01-30 05:36:35,571 INFO L226 Difference]: Without dead ends: 4465 [2018-01-30 05:36:35,572 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4465 states. [2018-01-30 05:36:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4465 to 3695. [2018-01-30 05:36:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3695 states. [2018-01-30 05:36:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 3695 states and 4846 transitions. [2018-01-30 05:36:35,617 INFO L78 Accepts]: Start accepts. Automaton has 3695 states and 4846 transitions. Word has length 80 [2018-01-30 05:36:35,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:35,617 INFO L432 AbstractCegarLoop]: Abstraction has 3695 states and 4846 transitions. [2018-01-30 05:36:35,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3695 states and 4846 transitions. [2018-01-30 05:36:35,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-30 05:36:35,619 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:35,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:35,619 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation]=== [2018-01-30 05:36:35,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1663703280, now seen corresponding path program 1 times [2018-01-30 05:36:35,619 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:35,619 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:35,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:35,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:35,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:35,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:35,668 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 05:36:35,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:35,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:35,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:35,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:35,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:35,669 INFO L87 Difference]: Start difference. First operand 3695 states and 4846 transitions. Second operand 3 states. [2018-01-30 05:36:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:35,761 INFO L93 Difference]: Finished difference Result 10803 states and 14192 transitions. [2018-01-30 05:36:35,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:35,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-01-30 05:36:35,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:35,774 INFO L225 Difference]: With dead ends: 10803 [2018-01-30 05:36:35,774 INFO L226 Difference]: Without dead ends: 7153 [2018-01-30 05:36:35,779 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7153 states. [2018-01-30 05:36:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7153 to 7151. [2018-01-30 05:36:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2018-01-30 05:36:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 9262 transitions. [2018-01-30 05:36:35,873 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 9262 transitions. Word has length 80 [2018-01-30 05:36:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:35,874 INFO L432 AbstractCegarLoop]: Abstraction has 7151 states and 9262 transitions. [2018-01-30 05:36:35,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 9262 transitions. [2018-01-30 05:36:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-30 05:36:35,876 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:35,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:35,876 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation]=== [2018-01-30 05:36:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash 572911513, now seen corresponding path program 1 times [2018-01-30 05:36:35,877 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:35,877 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:35,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:35,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:35,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:35,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:35,925 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 05:36:35,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:35,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:35,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:35,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:35,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:35,926 INFO L87 Difference]: Start difference. First operand 7151 states and 9262 transitions. Second operand 3 states. [2018-01-30 05:36:36,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:36,004 INFO L93 Difference]: Finished difference Result 8563 states and 11056 transitions. [2018-01-30 05:36:36,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:36,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-01-30 05:36:36,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:36,020 INFO L225 Difference]: With dead ends: 8563 [2018-01-30 05:36:36,021 INFO L226 Difference]: Without dead ends: 8561 [2018-01-30 05:36:36,023 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:36,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8561 states. [2018-01-30 05:36:36,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8561 to 7151. [2018-01-30 05:36:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2018-01-30 05:36:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 9198 transitions. [2018-01-30 05:36:36,147 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 9198 transitions. Word has length 81 [2018-01-30 05:36:36,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:36,148 INFO L432 AbstractCegarLoop]: Abstraction has 7151 states and 9198 transitions. [2018-01-30 05:36:36,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 9198 transitions. [2018-01-30 05:36:36,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-30 05:36:36,150 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:36,150 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:36,150 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation]=== [2018-01-30 05:36:36,150 INFO L82 PathProgramCache]: Analyzing trace with hash 35226997, now seen corresponding path program 1 times [2018-01-30 05:36:36,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:36,151 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:36,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:36,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:36,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:36,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:36,200 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 05:36:36,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:36,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:36,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:36,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:36,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:36,201 INFO L87 Difference]: Start difference. First operand 7151 states and 9198 transitions. Second operand 3 states. [2018-01-30 05:36:36,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:36,321 INFO L93 Difference]: Finished difference Result 20979 states and 26992 transitions. [2018-01-30 05:36:36,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:36,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-01-30 05:36:36,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:36,336 INFO L225 Difference]: With dead ends: 20979 [2018-01-30 05:36:36,336 INFO L226 Difference]: Without dead ends: 13873 [2018-01-30 05:36:36,346 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:36,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13873 states. [2018-01-30 05:36:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13873 to 13871. [2018-01-30 05:36:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13871 states. [2018-01-30 05:36:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13871 states to 13871 states and 17582 transitions. [2018-01-30 05:36:36,532 INFO L78 Accepts]: Start accepts. Automaton has 13871 states and 17582 transitions. Word has length 81 [2018-01-30 05:36:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:36,532 INFO L432 AbstractCegarLoop]: Abstraction has 13871 states and 17582 transitions. [2018-01-30 05:36:36,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 13871 states and 17582 transitions. [2018-01-30 05:36:36,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-30 05:36:36,536 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:36,536 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:36,536 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation]=== [2018-01-30 05:36:36,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1289010765, now seen corresponding path program 1 times [2018-01-30 05:36:36,537 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:36,537 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:36,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:36,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:36,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:36,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:36,599 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 05:36:36,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:36,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:36,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:36,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:36,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:36,600 INFO L87 Difference]: Start difference. First operand 13871 states and 17582 transitions. Second operand 3 states. [2018-01-30 05:36:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:36,718 INFO L93 Difference]: Finished difference Result 16435 states and 20656 transitions. [2018-01-30 05:36:36,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:36,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-01-30 05:36:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:36,735 INFO L225 Difference]: With dead ends: 16435 [2018-01-30 05:36:36,735 INFO L226 Difference]: Without dead ends: 16433 [2018-01-30 05:36:36,741 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:36,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16433 states. [2018-01-30 05:36:36,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16433 to 13871. [2018-01-30 05:36:36,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13871 states. [2018-01-30 05:36:36,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13871 states to 13871 states and 17454 transitions. [2018-01-30 05:36:36,947 INFO L78 Accepts]: Start accepts. Automaton has 13871 states and 17454 transitions. Word has length 82 [2018-01-30 05:36:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:36,948 INFO L432 AbstractCegarLoop]: Abstraction has 13871 states and 17454 transitions. [2018-01-30 05:36:36,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 13871 states and 17454 transitions. [2018-01-30 05:36:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-30 05:36:36,952 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:36,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:36,952 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation]=== [2018-01-30 05:36:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1092069931, now seen corresponding path program 1 times [2018-01-30 05:36:36,953 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:36,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:36,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:36,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:36,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:36,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:37,002 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 05:36:37,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:37,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:37,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:37,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:37,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:37,003 INFO L87 Difference]: Start difference. First operand 13871 states and 17454 transitions. Second operand 3 states. [2018-01-30 05:36:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:37,170 INFO L93 Difference]: Finished difference Result 40755 states and 51248 transitions. [2018-01-30 05:36:37,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:37,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-01-30 05:36:37,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:37,197 INFO L225 Difference]: With dead ends: 40755 [2018-01-30 05:36:37,197 INFO L226 Difference]: Without dead ends: 26929 [2018-01-30 05:36:37,213 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26929 states. [2018-01-30 05:36:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26929 to 26927. [2018-01-30 05:36:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26927 states. [2018-01-30 05:36:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26927 states to 26927 states and 33326 transitions. [2018-01-30 05:36:37,777 INFO L78 Accepts]: Start accepts. Automaton has 26927 states and 33326 transitions. Word has length 82 [2018-01-30 05:36:37,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:37,777 INFO L432 AbstractCegarLoop]: Abstraction has 26927 states and 33326 transitions. [2018-01-30 05:36:37,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:37,777 INFO L276 IsEmpty]: Start isEmpty. Operand 26927 states and 33326 transitions. [2018-01-30 05:36:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-30 05:36:37,785 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:37,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:37,785 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation]=== [2018-01-30 05:36:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2013251252, now seen corresponding path program 1 times [2018-01-30 05:36:37,785 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:37,785 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:37,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:37,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:37,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:37,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:37,843 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 05:36:37,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:37,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:37,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:37,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:37,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:37,843 INFO L87 Difference]: Start difference. First operand 26927 states and 33326 transitions. Second operand 3 states. [2018-01-30 05:36:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:38,094 INFO L93 Difference]: Finished difference Result 31539 states and 38448 transitions. [2018-01-30 05:36:38,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:38,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-01-30 05:36:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:38,122 INFO L225 Difference]: With dead ends: 31539 [2018-01-30 05:36:38,122 INFO L226 Difference]: Without dead ends: 31537 [2018-01-30 05:36:38,127 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:38,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31537 states. [2018-01-30 05:36:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31537 to 26927. [2018-01-30 05:36:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26927 states. [2018-01-30 05:36:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26927 states to 26927 states and 33070 transitions. [2018-01-30 05:36:38,439 INFO L78 Accepts]: Start accepts. Automaton has 26927 states and 33070 transitions. Word has length 83 [2018-01-30 05:36:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:38,439 INFO L432 AbstractCegarLoop]: Abstraction has 26927 states and 33070 transitions. [2018-01-30 05:36:38,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 26927 states and 33070 transitions. [2018-01-30 05:36:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-30 05:36:38,447 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:38,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:38,447 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation]=== [2018-01-30 05:36:38,447 INFO L82 PathProgramCache]: Analyzing trace with hash -505537328, now seen corresponding path program 1 times [2018-01-30 05:36:38,447 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:38,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:38,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:38,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:38,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:38,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:38,503 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 05:36:38,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:38,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:38,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:38,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:38,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:38,503 INFO L87 Difference]: Start difference. First operand 26927 states and 33070 transitions. Second operand 3 states. [2018-01-30 05:36:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:38,766 INFO L93 Difference]: Finished difference Result 79153 states and 97071 transitions. [2018-01-30 05:36:38,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:38,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-01-30 05:36:38,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:38,791 INFO L225 Difference]: With dead ends: 79153 [2018-01-30 05:36:38,791 INFO L226 Difference]: Without dead ends: 26927 [2018-01-30 05:36:38,828 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26927 states. [2018-01-30 05:36:39,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26927 to 26927. [2018-01-30 05:36:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26927 states. [2018-01-30 05:36:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26927 states to 26927 states and 32046 transitions. [2018-01-30 05:36:39,192 INFO L78 Accepts]: Start accepts. Automaton has 26927 states and 32046 transitions. Word has length 83 [2018-01-30 05:36:39,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:39,192 INFO L432 AbstractCegarLoop]: Abstraction has 26927 states and 32046 transitions. [2018-01-30 05:36:39,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand 26927 states and 32046 transitions. [2018-01-30 05:36:39,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-30 05:36:39,199 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:36:39,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:39,200 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation]=== [2018-01-30 05:36:39,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1305097272, now seen corresponding path program 1 times [2018-01-30 05:36:39,200 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:36:39,200 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:36:39,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:39,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:36:39,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:36:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:36:39,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:36:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 05:36:39,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:36:39,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:36:39,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:36:39,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:36:39,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:39,260 INFO L87 Difference]: Start difference. First operand 26927 states and 32046 transitions. Second operand 3 states. [2018-01-30 05:36:39,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:36:39,375 INFO L93 Difference]: Finished difference Result 26927 states and 32046 transitions. [2018-01-30 05:36:39,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:36:39,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-01-30 05:36:39,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:36:39,376 INFO L225 Difference]: With dead ends: 26927 [2018-01-30 05:36:39,376 INFO L226 Difference]: Without dead ends: 0 [2018-01-30 05:36:39,391 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:36:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-30 05:36:39,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-30 05:36:39,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-30 05:36:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-30 05:36:39,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2018-01-30 05:36:39,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:36:39,392 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-30 05:36:39,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:36:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-30 05:36:39,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-30 05:36:39,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-30 05:36:39,478 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 164) no Hoare annotation was computed. [2018-01-30 05:36:39,478 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(lines 1 164) the Hoare annotation is: true [2018-01-30 05:36:39,478 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 164) the Hoare annotation is: true [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 164) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 164) the Hoare annotation is: true [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 164) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L133'(lines 133 136) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L90'(lines 90 92) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L62(line 62) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L30''(line 30) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L15''(line 15) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L118'(lines 118 121) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L9''(line 9) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-01-30 05:36:39,479 INFO L399 ceAbstractionStarter]: For program point L18'(line 18) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L74'(lines 74 76) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L86'(lines 86 88) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L98'(lines 98 100) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 161) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L143'(lines 143 146) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L12''(line 12) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L128'(lines 128 131) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L9'(line 9) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-01-30 05:36:39,480 INFO L399 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L12'(line 12) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L40'(line 40) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L70'(lines 70 72) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L402 ceAbstractionStarter]: At program point L153'(lines 153 156) the Hoare annotation is: true [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L82'(lines 82 84) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-01-30 05:36:39,481 INFO L399 ceAbstractionStarter]: For program point L94'(lines 94 96) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L113'(lines 113 116) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L15'(line 15) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L27'(line 27) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L138'(lines 138 141) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L66''(lines 66 68) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L102'(lines 102 104) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L395 ceAbstractionStarter]: At program point L154'(line 154) the Hoare annotation is: false [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-01-30 05:36:39,482 INFO L399 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L402 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L39(lines 39 158) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L78'(lines 78 80) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L30'(line 30) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L123'(lines 123 126) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L33''(line 33) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L18''(line 18) no Hoare annotation was computed. [2018-01-30 05:36:39,483 INFO L399 ceAbstractionStarter]: For program point L33'(line 33) no Hoare annotation was computed. [2018-01-30 05:36:39,484 INFO L399 ceAbstractionStarter]: For program point L148'(lines 148 151) no Hoare annotation was computed. [2018-01-30 05:36:39,484 INFO L399 ceAbstractionStarter]: For program point L21'(line 21) no Hoare annotation was computed. [2018-01-30 05:36:39,484 INFO L399 ceAbstractionStarter]: For program point L108'(lines 108 111) no Hoare annotation was computed. [2018-01-30 05:36:39,484 INFO L399 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-01-30 05:36:39,484 INFO L399 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2018-01-30 05:36:39,484 INFO L399 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-01-30 05:36:39,484 INFO L399 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-01-30 05:36:39,484 INFO L399 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-01-30 05:36:39,484 INFO L402 ceAbstractionStarter]: At program point L159(lines 159 160) the Hoare annotation is: true [2018-01-30 05:36:39,484 INFO L399 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-01-30 05:36:39,484 INFO L399 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2018-01-30 05:36:39,484 INFO L399 ceAbstractionStarter]: For program point L21''(line 21) no Hoare annotation was computed. [2018-01-30 05:36:39,484 INFO L399 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-01-30 05:36:39,484 INFO L399 ceAbstractionStarter]: For program point L40''(line 40) no Hoare annotation was computed. [2018-01-30 05:36:39,484 INFO L399 ceAbstractionStarter]: For program point L6'(line 6) no Hoare annotation was computed. [2018-01-30 05:36:39,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:36:39 BasicIcfg [2018-01-30 05:36:39,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 05:36:39,489 INFO L168 Benchmark]: Toolchain (without parser) took 6650.99 ms. Allocated memory was 149.9 MB in the beginning and 626.0 MB in the end (delta: 476.1 MB). Free memory was 115.1 MB in the beginning and 137.2 MB in the end (delta: -22.1 MB). Peak memory consumption was 453.9 MB. Max. memory is 5.3 GB. [2018-01-30 05:36:39,489 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 149.9 MB. Free memory is still 119.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 05:36:39,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 122.66 ms. Allocated memory is still 149.9 MB. Free memory was 114.9 MB in the beginning and 105.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-01-30 05:36:39,490 INFO L168 Benchmark]: Boogie Preprocessor took 22.30 ms. Allocated memory is still 149.9 MB. Free memory was 105.7 MB in the beginning and 103.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. [2018-01-30 05:36:39,490 INFO L168 Benchmark]: RCFGBuilder took 493.14 ms. Allocated memory is still 149.9 MB. Free memory was 103.9 MB in the beginning and 81.0 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. [2018-01-30 05:36:39,490 INFO L168 Benchmark]: IcfgTransformer took 13.84 ms. Allocated memory is still 149.9 MB. Free memory was 81.0 MB in the beginning and 79.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. [2018-01-30 05:36:39,490 INFO L168 Benchmark]: TraceAbstraction took 5996.58 ms. Allocated memory was 149.9 MB in the beginning and 626.0 MB in the end (delta: 476.1 MB). Free memory was 79.1 MB in the beginning and 137.2 MB in the end (delta: -58.1 MB). Peak memory consumption was 418.0 MB. Max. memory is 5.3 GB. [2018-01-30 05:36:39,491 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.10 ms. Allocated memory is still 149.9 MB. Free memory is still 119.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 122.66 ms. Allocated memory is still 149.9 MB. Free memory was 114.9 MB in the beginning and 105.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.30 ms. Allocated memory is still 149.9 MB. Free memory was 105.7 MB in the beginning and 103.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. * RCFGBuilder took 493.14 ms. Allocated memory is still 149.9 MB. Free memory was 103.9 MB in the beginning and 81.0 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. * IcfgTransformer took 13.84 ms. Allocated memory is still 149.9 MB. Free memory was 81.0 MB in the beginning and 79.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5996.58 ms. Allocated memory was 149.9 MB in the beginning and 626.0 MB in the end (delta: 476.1 MB). Free memory was 79.1 MB in the beginning and 137.2 MB in the end (delta: -58.1 MB). Peak memory consumption was 418.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 119 locations, 1 error locations. SAFE Result, 5.9s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3655 SDtfs, 1337 SDslu, 2599 SDs, 0 SdLazy, 99 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26927occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 10238 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1033 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1580 NumberOfCodeBlocks, 1580 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1560 ConstructedInterpolants, 0 QuantifiedInterpolants, 154620 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_05-36-39-495.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_05-36-39-495.csv Received shutdown request...