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_14_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 05:38:03,656 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 05:38:03,657 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 05:38:03,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 05:38:03,666 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 05:38:03,667 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 05:38:03,667 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 05:38:03,668 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 05:38:03,670 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 05:38:03,670 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 05:38:03,671 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 05:38:03,671 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 05:38:03,671 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 05:38:03,672 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 05:38:03,673 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 05:38:03,674 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 05:38:03,675 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 05:38:03,676 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 05:38:03,677 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 05:38:03,677 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 05:38:03,679 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 05:38:03,679 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 05:38:03,679 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 05:38:03,679 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 05:38:03,680 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 05:38:03,681 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 05:38:03,681 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 05:38:03,681 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 05:38:03,681 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 05:38:03,681 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 05:38:03,682 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 05:38:03,682 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:38:03,687 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 05:38:03,687 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 05:38:03,688 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 05:38:03,688 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 05:38:03,688 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 05:38:03,688 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 05:38:03,688 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 05:38:03,688 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 05:38:03,688 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 05:38:03,688 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 05:38:03,688 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 05:38:03,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 05:38:03,689 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 05:38:03,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 05:38:03,689 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 05:38:03,689 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 05:38:03,689 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 05:38:03,689 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 05:38:03,689 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 05:38:03,689 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 05:38:03,689 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 05:38:03,689 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 05:38:03,689 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 05:38:03,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 05:38:03,690 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 05:38:03,690 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 05:38:03,690 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 05:38:03,690 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 05:38:03,690 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 05:38:03,690 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 05:38:03,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 05:38:03,690 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 05:38:03,691 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 05:38:03,691 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 05:38:03,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 05:38:03,715 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 05:38:03,717 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 05:38:03,718 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 05:38:03,718 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 05:38:03,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-01-30 05:38:03,785 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 05:38:03,786 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 05:38:03,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 05:38:03,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 05:38:03,790 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 05:38:03,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:38:03" (1/1) ... [2018-01-30 05:38:03,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3c742c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:38:03, skipping insertion in model container [2018-01-30 05:38:03,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 05:38:03" (1/1) ... [2018-01-30 05:38:03,801 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:38:03,813 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 05:38:03,888 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:38:03,902 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 05:38:03,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:38:03 WrapperNode [2018-01-30 05:38:03,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 05:38:03,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 05:38:03,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 05:38:03,905 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 05:38:03,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:38:03" (1/1) ... [2018-01-30 05:38:03,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:38:03" (1/1) ... [2018-01-30 05:38:03,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:38:03" (1/1) ... [2018-01-30 05:38:03,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:38:03" (1/1) ... [2018-01-30 05:38:03,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:38:03" (1/1) ... [2018-01-30 05:38:03,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:38:03" (1/1) ... [2018-01-30 05:38:03,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:38:03" (1/1) ... [2018-01-30 05:38:03,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 05:38:03,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 05:38:03,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 05:38:03,925 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 05:38:03,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:38:03" (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:38:03,969 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 05:38:03,969 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 05:38:03,969 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 05:38:03,969 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 05:38:03,969 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 05:38:03,969 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 05:38:03,969 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 05:38:03,970 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 05:38:04,507 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 05:38:04,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:38:04 BoogieIcfgContainer [2018-01-30 05:38:04,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 05:38:04,508 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 05:38:04,508 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 05:38:04,509 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 05:38:04,511 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:38:04" (1/1) ... [2018-01-30 05:38:04,513 WARN L213 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-01-30 05:38:04,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:38:04 BasicIcfg [2018-01-30 05:38:04,523 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 05:38:04,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 05:38:04,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 05:38:04,526 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 05:38:04,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 05:38:03" (1/4) ... [2018-01-30 05:38:04,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34dd55ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:38:04, skipping insertion in model container [2018-01-30 05:38:04,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 05:38:03" (2/4) ... [2018-01-30 05:38:04,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34dd55ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 05:38:04, skipping insertion in model container [2018-01-30 05:38:04,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 05:38:04" (3/4) ... [2018-01-30 05:38:04,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34dd55ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:38:04, skipping insertion in model container [2018-01-30 05:38:04,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 05:38:04" (4/4) ... [2018-01-30 05:38:04,528 INFO L107 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.cleft_unchanged_by_heapseparator [2018-01-30 05:38:04,533 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 05:38:04,537 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 05:38:04,574 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 05:38:04,575 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 05:38:04,575 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 05:38:04,575 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 05:38:04,575 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 05:38:04,575 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 05:38:04,575 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 05:38:04,575 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 05:38:04,575 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 05:38:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2018-01-30 05:38:04,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-01-30 05:38:04,591 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:04,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:38:04,592 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation]=== [2018-01-30 05:38:04,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1777582428, now seen corresponding path program 1 times [2018-01-30 05:38:04,596 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:04,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:04,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:04,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:04,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:04,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:04,736 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:38:04,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:04,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:04,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:04,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:04,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:04,747 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 3 states. [2018-01-30 05:38:04,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:04,818 INFO L93 Difference]: Finished difference Result 350 states and 482 transitions. [2018-01-30 05:38:04,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:04,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-01-30 05:38:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:04,882 INFO L225 Difference]: With dead ends: 350 [2018-01-30 05:38:04,882 INFO L226 Difference]: Without dead ends: 242 [2018-01-30 05:38:04,884 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:38:04,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-30 05:38:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-01-30 05:38:04,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-30 05:38:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 320 transitions. [2018-01-30 05:38:04,914 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 320 transitions. Word has length 98 [2018-01-30 05:38:04,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:04,915 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 320 transitions. [2018-01-30 05:38:04,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 320 transitions. [2018-01-30 05:38:04,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-30 05:38:04,916 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:04,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:38:04,917 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation]=== [2018-01-30 05:38:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2613645, now seen corresponding path program 1 times [2018-01-30 05:38:04,917 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:04,917 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:04,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:04,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:04,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:04,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:05,033 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:38:05,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:05,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:05,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:05,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:05,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:05,035 INFO L87 Difference]: Start difference. First operand 240 states and 320 transitions. Second operand 3 states. [2018-01-30 05:38:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:05,108 INFO L93 Difference]: Finished difference Result 290 states and 394 transitions. [2018-01-30 05:38:05,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:05,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-01-30 05:38:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:05,110 INFO L225 Difference]: With dead ends: 290 [2018-01-30 05:38:05,110 INFO L226 Difference]: Without dead ends: 288 [2018-01-30 05:38:05,111 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:38:05,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-01-30 05:38:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 240. [2018-01-30 05:38:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-30 05:38:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 319 transitions. [2018-01-30 05:38:05,124 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 319 transitions. Word has length 99 [2018-01-30 05:38:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:05,124 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 319 transitions. [2018-01-30 05:38:05,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 319 transitions. [2018-01-30 05:38:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-30 05:38:05,126 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:05,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:38:05,126 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation]=== [2018-01-30 05:38:05,126 INFO L82 PathProgramCache]: Analyzing trace with hash -729487640, now seen corresponding path program 1 times [2018-01-30 05:38:05,126 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:05,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:05,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:05,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:05,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:05,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:05,217 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:38:05,217 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:05,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:05,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:05,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:05,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:05,219 INFO L87 Difference]: Start difference. First operand 240 states and 319 transitions. Second operand 3 states. [2018-01-30 05:38:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:05,252 INFO L93 Difference]: Finished difference Result 592 states and 827 transitions. [2018-01-30 05:38:05,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:05,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-01-30 05:38:05,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:05,255 INFO L225 Difference]: With dead ends: 592 [2018-01-30 05:38:05,255 INFO L226 Difference]: Without dead ends: 413 [2018-01-30 05:38:05,255 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:38:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-01-30 05:38:05,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2018-01-30 05:38:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-01-30 05:38:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 564 transitions. [2018-01-30 05:38:05,267 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 564 transitions. Word has length 99 [2018-01-30 05:38:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:05,267 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 564 transitions. [2018-01-30 05:38:05,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 564 transitions. [2018-01-30 05:38:05,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-30 05:38:05,269 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:05,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:38:05,269 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation]=== [2018-01-30 05:38:05,269 INFO L82 PathProgramCache]: Analyzing trace with hash -407179592, now seen corresponding path program 1 times [2018-01-30 05:38:05,269 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:05,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:05,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:05,270 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:05,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:05,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:05,306 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:38:05,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:05,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:05,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:05,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:05,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:05,307 INFO L87 Difference]: Start difference. First operand 411 states and 564 transitions. Second operand 3 states. [2018-01-30 05:38:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:05,343 INFO L93 Difference]: Finished difference Result 503 states and 702 transitions. [2018-01-30 05:38:05,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:05,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-01-30 05:38:05,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:05,345 INFO L225 Difference]: With dead ends: 503 [2018-01-30 05:38:05,345 INFO L226 Difference]: Without dead ends: 501 [2018-01-30 05:38:05,345 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:38:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-01-30 05:38:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 411. [2018-01-30 05:38:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-01-30 05:38:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 562 transitions. [2018-01-30 05:38:05,354 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 562 transitions. Word has length 100 [2018-01-30 05:38:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:05,354 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 562 transitions. [2018-01-30 05:38:05,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:05,355 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 562 transitions. [2018-01-30 05:38:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-30 05:38:05,356 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:05,356 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:38:05,356 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation]=== [2018-01-30 05:38:05,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1139248234, now seen corresponding path program 1 times [2018-01-30 05:38:05,356 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:05,356 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:05,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:05,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:05,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:05,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:05,421 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:38:05,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:05,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:05,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:05,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:05,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:05,422 INFO L87 Difference]: Start difference. First operand 411 states and 562 transitions. Second operand 3 states. [2018-01-30 05:38:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:05,498 INFO L93 Difference]: Finished difference Result 1099 states and 1548 transitions. [2018-01-30 05:38:05,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:05,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-01-30 05:38:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:05,500 INFO L225 Difference]: With dead ends: 1099 [2018-01-30 05:38:05,500 INFO L226 Difference]: Without dead ends: 749 [2018-01-30 05:38:05,501 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:38:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-01-30 05:38:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 747. [2018-01-30 05:38:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-01-30 05:38:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1038 transitions. [2018-01-30 05:38:05,519 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1038 transitions. Word has length 100 [2018-01-30 05:38:05,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:05,520 INFO L432 AbstractCegarLoop]: Abstraction has 747 states and 1038 transitions. [2018-01-30 05:38:05,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:05,520 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1038 transitions. [2018-01-30 05:38:05,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-30 05:38:05,521 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:05,522 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:38:05,522 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation]=== [2018-01-30 05:38:05,522 INFO L82 PathProgramCache]: Analyzing trace with hash -225867865, now seen corresponding path program 1 times [2018-01-30 05:38:05,522 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:05,522 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:05,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:05,523 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:05,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:05,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:05,587 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:38:05,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:05,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:05,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:05,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:05,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:05,588 INFO L87 Difference]: Start difference. First operand 747 states and 1038 transitions. Second operand 3 states. [2018-01-30 05:38:05,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:05,639 INFO L93 Difference]: Finished difference Result 919 states and 1296 transitions. [2018-01-30 05:38:05,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:05,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-01-30 05:38:05,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:05,641 INFO L225 Difference]: With dead ends: 919 [2018-01-30 05:38:05,641 INFO L226 Difference]: Without dead ends: 917 [2018-01-30 05:38:05,641 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:38:05,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-01-30 05:38:05,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 747. [2018-01-30 05:38:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-01-30 05:38:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1034 transitions. [2018-01-30 05:38:05,650 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1034 transitions. Word has length 101 [2018-01-30 05:38:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:05,650 INFO L432 AbstractCegarLoop]: Abstraction has 747 states and 1034 transitions. [2018-01-30 05:38:05,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1034 transitions. [2018-01-30 05:38:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-30 05:38:05,651 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:05,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:38:05,652 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation]=== [2018-01-30 05:38:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash -956924605, now seen corresponding path program 1 times [2018-01-30 05:38:05,652 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:05,652 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:05,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:05,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:05,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:05,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:05,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:38:05,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:05,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:05,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:05,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:05,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:05,711 INFO L87 Difference]: Start difference. First operand 747 states and 1034 transitions. Second operand 3 states. [2018-01-30 05:38:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:05,775 INFO L93 Difference]: Finished difference Result 2095 states and 2948 transitions. [2018-01-30 05:38:05,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:05,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-01-30 05:38:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:05,778 INFO L225 Difference]: With dead ends: 2095 [2018-01-30 05:38:05,778 INFO L226 Difference]: Without dead ends: 1409 [2018-01-30 05:38:05,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:38:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2018-01-30 05:38:05,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1407. [2018-01-30 05:38:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1407 states. [2018-01-30 05:38:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1958 transitions. [2018-01-30 05:38:05,794 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1958 transitions. Word has length 101 [2018-01-30 05:38:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:05,794 INFO L432 AbstractCegarLoop]: Abstraction has 1407 states and 1958 transitions. [2018-01-30 05:38:05,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1958 transitions. [2018-01-30 05:38:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-30 05:38:05,795 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:05,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:38:05,795 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation]=== [2018-01-30 05:38:05,795 INFO L82 PathProgramCache]: Analyzing trace with hash 400140753, now seen corresponding path program 1 times [2018-01-30 05:38:05,795 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:05,795 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:05,801 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:05,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:05,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:05,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:05,858 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:38:05,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:05,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:05,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:05,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:05,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:05,859 INFO L87 Difference]: Start difference. First operand 1407 states and 1958 transitions. Second operand 3 states. [2018-01-30 05:38:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:05,956 INFO L93 Difference]: Finished difference Result 4051 states and 5688 transitions. [2018-01-30 05:38:05,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:05,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-01-30 05:38:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:05,962 INFO L225 Difference]: With dead ends: 4051 [2018-01-30 05:38:05,962 INFO L226 Difference]: Without dead ends: 2705 [2018-01-30 05:38:05,964 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:38:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2018-01-30 05:38:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 2703. [2018-01-30 05:38:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2703 states. [2018-01-30 05:38:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 3758 transitions. [2018-01-30 05:38:05,998 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 3758 transitions. Word has length 102 [2018-01-30 05:38:05,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:05,998 INFO L432 AbstractCegarLoop]: Abstraction has 2703 states and 3758 transitions. [2018-01-30 05:38:05,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 3758 transitions. [2018-01-30 05:38:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-30 05:38:05,999 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:05,999 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:38:06,000 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation]=== [2018-01-30 05:38:06,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1099828531, now seen corresponding path program 1 times [2018-01-30 05:38:06,000 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:06,000 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:06,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:06,001 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:06,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:06,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:06,073 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:38:06,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:06,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:06,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:06,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:06,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:06,074 INFO L87 Difference]: Start difference. First operand 2703 states and 3758 transitions. Second operand 3 states. [2018-01-30 05:38:06,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:06,142 INFO L93 Difference]: Finished difference Result 3331 states and 4688 transitions. [2018-01-30 05:38:06,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:06,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-01-30 05:38:06,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:06,150 INFO L225 Difference]: With dead ends: 3331 [2018-01-30 05:38:06,150 INFO L226 Difference]: Without dead ends: 3329 [2018-01-30 05:38:06,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:38:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2018-01-30 05:38:06,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 2703. [2018-01-30 05:38:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2703 states. [2018-01-30 05:38:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 3742 transitions. [2018-01-30 05:38:06,186 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 3742 transitions. Word has length 102 [2018-01-30 05:38:06,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:06,186 INFO L432 AbstractCegarLoop]: Abstraction has 2703 states and 3742 transitions. [2018-01-30 05:38:06,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:06,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 3742 transitions. [2018-01-30 05:38:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-01-30 05:38:06,188 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:06,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:38:06,188 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation]=== [2018-01-30 05:38:06,188 INFO L82 PathProgramCache]: Analyzing trace with hash -753255998, now seen corresponding path program 1 times [2018-01-30 05:38:06,188 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:06,188 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:06,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:06,189 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:06,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:06,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:06,269 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:38:06,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:06,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:06,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:06,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:06,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:06,270 INFO L87 Difference]: Start difference. First operand 2703 states and 3742 transitions. Second operand 3 states. [2018-01-30 05:38:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:06,333 INFO L93 Difference]: Finished difference Result 3315 states and 4640 transitions. [2018-01-30 05:38:06,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:06,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-01-30 05:38:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:06,340 INFO L225 Difference]: With dead ends: 3315 [2018-01-30 05:38:06,340 INFO L226 Difference]: Without dead ends: 3313 [2018-01-30 05:38:06,341 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:38:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3313 states. [2018-01-30 05:38:06,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3313 to 2703. [2018-01-30 05:38:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2703 states. [2018-01-30 05:38:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 3726 transitions. [2018-01-30 05:38:06,375 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 3726 transitions. Word has length 103 [2018-01-30 05:38:06,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:06,375 INFO L432 AbstractCegarLoop]: Abstraction has 2703 states and 3726 transitions. [2018-01-30 05:38:06,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 3726 transitions. [2018-01-30 05:38:06,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-01-30 05:38:06,376 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:06,376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:38:06,376 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation]=== [2018-01-30 05:38:06,377 INFO L82 PathProgramCache]: Analyzing trace with hash -480505954, now seen corresponding path program 1 times [2018-01-30 05:38:06,377 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:06,377 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:06,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:06,379 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:06,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:06,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:06,439 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:38:06,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:06,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:06,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:06,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:06,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:06,440 INFO L87 Difference]: Start difference. First operand 2703 states and 3726 transitions. Second operand 3 states. [2018-01-30 05:38:06,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:06,535 INFO L93 Difference]: Finished difference Result 7891 states and 10928 transitions. [2018-01-30 05:38:06,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:06,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-01-30 05:38:06,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:06,545 INFO L225 Difference]: With dead ends: 7891 [2018-01-30 05:38:06,546 INFO L226 Difference]: Without dead ends: 5249 [2018-01-30 05:38:06,550 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:38:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5249 states. [2018-01-30 05:38:06,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5249 to 5247. [2018-01-30 05:38:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5247 states. [2018-01-30 05:38:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5247 states to 5247 states and 7198 transitions. [2018-01-30 05:38:06,625 INFO L78 Accepts]: Start accepts. Automaton has 5247 states and 7198 transitions. Word has length 103 [2018-01-30 05:38:06,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:06,625 INFO L432 AbstractCegarLoop]: Abstraction has 5247 states and 7198 transitions. [2018-01-30 05:38:06,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 5247 states and 7198 transitions. [2018-01-30 05:38:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-30 05:38:06,627 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:06,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:38:06,627 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation]=== [2018-01-30 05:38:06,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1930665902, now seen corresponding path program 1 times [2018-01-30 05:38:06,628 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:06,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:06,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:06,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:06,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:06,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:06,683 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:38:06,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:06,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:06,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:06,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:06,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:06,684 INFO L87 Difference]: Start difference. First operand 5247 states and 7198 transitions. Second operand 3 states. [2018-01-30 05:38:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:06,750 INFO L93 Difference]: Finished difference Result 6403 states and 8864 transitions. [2018-01-30 05:38:06,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:06,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-01-30 05:38:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:06,766 INFO L225 Difference]: With dead ends: 6403 [2018-01-30 05:38:06,766 INFO L226 Difference]: Without dead ends: 6401 [2018-01-30 05:38:06,770 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:38:06,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6401 states. [2018-01-30 05:38:06,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6401 to 5247. [2018-01-30 05:38:06,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5247 states. [2018-01-30 05:38:06,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5247 states to 5247 states and 7166 transitions. [2018-01-30 05:38:06,841 INFO L78 Accepts]: Start accepts. Automaton has 5247 states and 7166 transitions. Word has length 104 [2018-01-30 05:38:06,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:06,844 INFO L432 AbstractCegarLoop]: Abstraction has 5247 states and 7166 transitions. [2018-01-30 05:38:06,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:06,844 INFO L276 IsEmpty]: Start isEmpty. Operand 5247 states and 7166 transitions. [2018-01-30 05:38:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-30 05:38:06,846 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:06,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 05:38:06,847 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation]=== [2018-01-30 05:38:06,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2010749940, now seen corresponding path program 1 times [2018-01-30 05:38:06,847 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:06,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:06,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:06,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:06,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:06,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:06,913 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:38:06,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:06,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:06,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:06,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:06,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:06,918 INFO L87 Difference]: Start difference. First operand 5247 states and 7166 transitions. Second operand 3 states. [2018-01-30 05:38:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:07,019 INFO L93 Difference]: Finished difference Result 15427 states and 21120 transitions. [2018-01-30 05:38:07,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:07,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-01-30 05:38:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:07,037 INFO L225 Difference]: With dead ends: 15427 [2018-01-30 05:38:07,037 INFO L226 Difference]: Without dead ends: 10241 [2018-01-30 05:38:07,047 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:38:07,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10241 states. [2018-01-30 05:38:07,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10241 to 10239. [2018-01-30 05:38:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10239 states. [2018-01-30 05:38:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10239 states to 10239 states and 13886 transitions. [2018-01-30 05:38:07,191 INFO L78 Accepts]: Start accepts. Automaton has 10239 states and 13886 transitions. Word has length 104 [2018-01-30 05:38:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:07,191 INFO L432 AbstractCegarLoop]: Abstraction has 10239 states and 13886 transitions. [2018-01-30 05:38:07,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 10239 states and 13886 transitions. [2018-01-30 05:38:07,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-30 05:38:07,195 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:07,195 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, 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:38:07,195 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation]=== [2018-01-30 05:38:07,195 INFO L82 PathProgramCache]: Analyzing trace with hash -767100963, now seen corresponding path program 1 times [2018-01-30 05:38:07,195 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:07,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:07,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:07,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:07,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:07,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:07,252 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:38:07,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:07,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:07,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:07,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:07,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:07,253 INFO L87 Difference]: Start difference. First operand 10239 states and 13886 transitions. Second operand 3 states. [2018-01-30 05:38:07,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:07,339 INFO L93 Difference]: Finished difference Result 12419 states and 16960 transitions. [2018-01-30 05:38:07,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:07,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-01-30 05:38:07,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:07,353 INFO L225 Difference]: With dead ends: 12419 [2018-01-30 05:38:07,353 INFO L226 Difference]: Without dead ends: 12417 [2018-01-30 05:38:07,358 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:38:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12417 states. [2018-01-30 05:38:07,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12417 to 10239. [2018-01-30 05:38:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10239 states. [2018-01-30 05:38:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10239 states to 10239 states and 13822 transitions. [2018-01-30 05:38:07,512 INFO L78 Accepts]: Start accepts. Automaton has 10239 states and 13822 transitions. Word has length 105 [2018-01-30 05:38:07,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:07,512 INFO L432 AbstractCegarLoop]: Abstraction has 10239 states and 13822 transitions. [2018-01-30 05:38:07,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:07,512 INFO L276 IsEmpty]: Start isEmpty. Operand 10239 states and 13822 transitions. [2018-01-30 05:38:07,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-30 05:38:07,517 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:07,517 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, 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:38:07,517 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation]=== [2018-01-30 05:38:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2091294201, now seen corresponding path program 1 times [2018-01-30 05:38:07,517 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:07,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:07,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:07,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:07,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:07,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:07,577 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:38:07,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:07,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:07,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:07,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:07,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:07,578 INFO L87 Difference]: Start difference. First operand 10239 states and 13822 transitions. Second operand 3 states. [2018-01-30 05:38:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:07,718 INFO L93 Difference]: Finished difference Result 30211 states and 40832 transitions. [2018-01-30 05:38:07,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:07,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-01-30 05:38:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:07,739 INFO L225 Difference]: With dead ends: 30211 [2018-01-30 05:38:07,739 INFO L226 Difference]: Without dead ends: 20033 [2018-01-30 05:38:07,752 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:38:07,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20033 states. [2018-01-30 05:38:07,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20033 to 20031. [2018-01-30 05:38:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20031 states. [2018-01-30 05:38:08,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20031 states to 20031 states and 26814 transitions. [2018-01-30 05:38:08,006 INFO L78 Accepts]: Start accepts. Automaton has 20031 states and 26814 transitions. Word has length 105 [2018-01-30 05:38:08,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:08,006 INFO L432 AbstractCegarLoop]: Abstraction has 20031 states and 26814 transitions. [2018-01-30 05:38:08,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand 20031 states and 26814 transitions. [2018-01-30 05:38:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-30 05:38:08,013 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:08,013 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, 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:38:08,013 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation]=== [2018-01-30 05:38:08,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1501472297, now seen corresponding path program 1 times [2018-01-30 05:38:08,013 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:08,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:08,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:08,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:08,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:08,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:08,080 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:38:08,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:08,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:08,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:08,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:08,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:08,082 INFO L87 Difference]: Start difference. First operand 20031 states and 26814 transitions. Second operand 3 states. [2018-01-30 05:38:08,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:08,470 INFO L93 Difference]: Finished difference Result 24131 states and 32448 transitions. [2018-01-30 05:38:08,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:08,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2018-01-30 05:38:08,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:08,492 INFO L225 Difference]: With dead ends: 24131 [2018-01-30 05:38:08,493 INFO L226 Difference]: Without dead ends: 24129 [2018-01-30 05:38:08,498 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:38:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24129 states. [2018-01-30 05:38:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24129 to 20031. [2018-01-30 05:38:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20031 states. [2018-01-30 05:38:08,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20031 states to 20031 states and 26686 transitions. [2018-01-30 05:38:08,680 INFO L78 Accepts]: Start accepts. Automaton has 20031 states and 26686 transitions. Word has length 106 [2018-01-30 05:38:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:08,680 INFO L432 AbstractCegarLoop]: Abstraction has 20031 states and 26686 transitions. [2018-01-30 05:38:08,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 20031 states and 26686 transitions. [2018-01-30 05:38:08,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-30 05:38:08,687 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:08,687 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, 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:38:08,687 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation]=== [2018-01-30 05:38:08,687 INFO L82 PathProgramCache]: Analyzing trace with hash 405643847, now seen corresponding path program 1 times [2018-01-30 05:38:08,687 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:08,688 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:08,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:08,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:08,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:08,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:08,803 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:38:08,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:08,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:08,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:08,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:08,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:08,804 INFO L87 Difference]: Start difference. First operand 20031 states and 26686 transitions. Second operand 3 states. [2018-01-30 05:38:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:09,002 INFO L93 Difference]: Finished difference Result 59203 states and 78912 transitions. [2018-01-30 05:38:09,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:09,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2018-01-30 05:38:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:09,042 INFO L225 Difference]: With dead ends: 59203 [2018-01-30 05:38:09,042 INFO L226 Difference]: Without dead ends: 39233 [2018-01-30 05:38:09,066 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:38:09,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39233 states. [2018-01-30 05:38:09,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39233 to 39231. [2018-01-30 05:38:09,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39231 states. [2018-01-30 05:38:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39231 states to 39231 states and 51774 transitions. [2018-01-30 05:38:09,478 INFO L78 Accepts]: Start accepts. Automaton has 39231 states and 51774 transitions. Word has length 106 [2018-01-30 05:38:09,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:09,478 INFO L432 AbstractCegarLoop]: Abstraction has 39231 states and 51774 transitions. [2018-01-30 05:38:09,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 39231 states and 51774 transitions. [2018-01-30 05:38:09,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-30 05:38:09,490 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:09,490 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, 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:38:09,490 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation]=== [2018-01-30 05:38:09,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1187200520, now seen corresponding path program 1 times [2018-01-30 05:38:09,490 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:09,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:09,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:09,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:09,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:09,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:09,557 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:38:09,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:09,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:09,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:09,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:09,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:09,558 INFO L87 Difference]: Start difference. First operand 39231 states and 51774 transitions. Second operand 3 states. [2018-01-30 05:38:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:09,973 INFO L93 Difference]: Finished difference Result 46915 states and 62016 transitions. [2018-01-30 05:38:09,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:09,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-01-30 05:38:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:10,002 INFO L225 Difference]: With dead ends: 46915 [2018-01-30 05:38:10,002 INFO L226 Difference]: Without dead ends: 46913 [2018-01-30 05:38:10,006 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:38:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46913 states. [2018-01-30 05:38:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46913 to 39231. [2018-01-30 05:38:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39231 states. [2018-01-30 05:38:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39231 states to 39231 states and 51518 transitions. [2018-01-30 05:38:10,997 INFO L78 Accepts]: Start accepts. Automaton has 39231 states and 51518 transitions. Word has length 107 [2018-01-30 05:38:10,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:10,997 INFO L432 AbstractCegarLoop]: Abstraction has 39231 states and 51518 transitions. [2018-01-30 05:38:10,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 39231 states and 51518 transitions. [2018-01-30 05:38:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-30 05:38:11,009 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:11,009 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, 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:38:11,009 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation]=== [2018-01-30 05:38:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash -309909420, now seen corresponding path program 1 times [2018-01-30 05:38:11,009 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:11,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:11,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:11,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:11,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:11,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:11,073 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:38:11,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:11,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:11,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:11,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:11,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:11,074 INFO L87 Difference]: Start difference. First operand 39231 states and 51518 transitions. Second operand 3 states. [2018-01-30 05:38:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:11,419 INFO L93 Difference]: Finished difference Result 116035 states and 152384 transitions. [2018-01-30 05:38:11,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:11,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-01-30 05:38:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:11,476 INFO L225 Difference]: With dead ends: 116035 [2018-01-30 05:38:11,476 INFO L226 Difference]: Without dead ends: 76865 [2018-01-30 05:38:11,514 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:38:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76865 states. [2018-01-30 05:38:12,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76865 to 76863. [2018-01-30 05:38:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76863 states. [2018-01-30 05:38:12,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76863 states to 76863 states and 99902 transitions. [2018-01-30 05:38:12,495 INFO L78 Accepts]: Start accepts. Automaton has 76863 states and 99902 transitions. Word has length 107 [2018-01-30 05:38:12,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:12,496 INFO L432 AbstractCegarLoop]: Abstraction has 76863 states and 99902 transitions. [2018-01-30 05:38:12,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:12,496 INFO L276 IsEmpty]: Start isEmpty. Operand 76863 states and 99902 transitions. [2018-01-30 05:38:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-30 05:38:12,518 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:12,518 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, 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:38:12,518 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation]=== [2018-01-30 05:38:12,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1363288228, now seen corresponding path program 1 times [2018-01-30 05:38:12,519 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:12,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:12,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:12,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:12,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:12,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:12,573 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:38:12,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:12,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:12,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:12,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:12,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:12,574 INFO L87 Difference]: Start difference. First operand 76863 states and 99902 transitions. Second operand 3 states. [2018-01-30 05:38:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:12,894 INFO L93 Difference]: Finished difference Result 91203 states and 118336 transitions. [2018-01-30 05:38:12,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:12,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-01-30 05:38:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:12,961 INFO L225 Difference]: With dead ends: 91203 [2018-01-30 05:38:12,962 INFO L226 Difference]: Without dead ends: 91201 [2018-01-30 05:38:12,978 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:38:13,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91201 states. [2018-01-30 05:38:14,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91201 to 76863. [2018-01-30 05:38:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76863 states. [2018-01-30 05:38:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76863 states to 76863 states and 99390 transitions. [2018-01-30 05:38:14,490 INFO L78 Accepts]: Start accepts. Automaton has 76863 states and 99390 transitions. Word has length 108 [2018-01-30 05:38:14,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:14,490 INFO L432 AbstractCegarLoop]: Abstraction has 76863 states and 99390 transitions. [2018-01-30 05:38:14,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 76863 states and 99390 transitions. [2018-01-30 05:38:14,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-30 05:38:14,504 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:14,504 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, 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:38:14,504 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation]=== [2018-01-30 05:38:14,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1017224062, now seen corresponding path program 1 times [2018-01-30 05:38:14,504 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:14,504 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:14,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:14,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:14,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:14,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:14,564 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:38:14,564 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:14,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:14,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:14,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:14,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:14,564 INFO L87 Difference]: Start difference. First operand 76863 states and 99390 transitions. Second operand 3 states. [2018-01-30 05:38:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:15,300 INFO L93 Difference]: Finished difference Result 227395 states and 293952 transitions. [2018-01-30 05:38:15,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:15,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-01-30 05:38:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:15,405 INFO L225 Difference]: With dead ends: 227395 [2018-01-30 05:38:15,405 INFO L226 Difference]: Without dead ends: 150593 [2018-01-30 05:38:15,452 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:38:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150593 states. [2018-01-30 05:38:17,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150593 to 150591. [2018-01-30 05:38:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150591 states. [2018-01-30 05:38:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150591 states to 150591 states and 192574 transitions. [2018-01-30 05:38:18,008 INFO L78 Accepts]: Start accepts. Automaton has 150591 states and 192574 transitions. Word has length 108 [2018-01-30 05:38:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:18,008 INFO L432 AbstractCegarLoop]: Abstraction has 150591 states and 192574 transitions. [2018-01-30 05:38:18,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 150591 states and 192574 transitions. [2018-01-30 05:38:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-30 05:38:18,036 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:18,036 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, 1, 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:38:18,036 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation]=== [2018-01-30 05:38:18,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1175939053, now seen corresponding path program 1 times [2018-01-30 05:38:18,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:18,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:18,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:18,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:18,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:18,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:18,090 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:38:18,091 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:18,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:18,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:18,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:18,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:18,092 INFO L87 Difference]: Start difference. First operand 150591 states and 192574 transitions. Second operand 3 states. [2018-01-30 05:38:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:18,689 INFO L93 Difference]: Finished difference Result 177219 states and 225344 transitions. [2018-01-30 05:38:18,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:18,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-01-30 05:38:18,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:18,818 INFO L225 Difference]: With dead ends: 177219 [2018-01-30 05:38:18,818 INFO L226 Difference]: Without dead ends: 177217 [2018-01-30 05:38:18,849 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:38:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177217 states. [2018-01-30 05:38:21,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177217 to 150591. [2018-01-30 05:38:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150591 states. [2018-01-30 05:38:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150591 states to 150591 states and 191550 transitions. [2018-01-30 05:38:21,789 INFO L78 Accepts]: Start accepts. Automaton has 150591 states and 191550 transitions. Word has length 109 [2018-01-30 05:38:21,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:21,789 INFO L432 AbstractCegarLoop]: Abstraction has 150591 states and 191550 transitions. [2018-01-30 05:38:21,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand 150591 states and 191550 transitions. [2018-01-30 05:38:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-30 05:38:21,815 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:21,815 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, 1, 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:38:21,815 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation]=== [2018-01-30 05:38:21,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1469141329, now seen corresponding path program 1 times [2018-01-30 05:38:21,815 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:21,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:21,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:21,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:21,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:21,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:21,880 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:38:21,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:21,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:21,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:21,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:21,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:21,881 INFO L87 Difference]: Start difference. First operand 150591 states and 191550 transitions. Second operand 3 states. [2018-01-30 05:38:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:23,427 INFO L93 Difference]: Finished difference Result 445507 states and 566336 transitions. [2018-01-30 05:38:23,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:23,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-01-30 05:38:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:23,638 INFO L225 Difference]: With dead ends: 445507 [2018-01-30 05:38:23,638 INFO L226 Difference]: Without dead ends: 294977 [2018-01-30 05:38:23,715 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:38:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294977 states. [2018-01-30 05:38:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294977 to 294975. [2018-01-30 05:38:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294975 states. [2018-01-30 05:38:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294975 states to 294975 states and 370750 transitions. [2018-01-30 05:38:28,644 INFO L78 Accepts]: Start accepts. Automaton has 294975 states and 370750 transitions. Word has length 109 [2018-01-30 05:38:28,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:28,644 INFO L432 AbstractCegarLoop]: Abstraction has 294975 states and 370750 transitions. [2018-01-30 05:38:28,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 294975 states and 370750 transitions. [2018-01-30 05:38:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-30 05:38:28,696 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:28,696 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, 1, 1, 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:38:28,696 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation]=== [2018-01-30 05:38:28,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1712394015, now seen corresponding path program 1 times [2018-01-30 05:38:28,696 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:28,696 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:28,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:28,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:28,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:28,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:28,750 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:38:28,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:28,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:28,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:28,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:28,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:28,751 INFO L87 Difference]: Start difference. First operand 294975 states and 370750 transitions. Second operand 3 states. [2018-01-30 05:38:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:32,134 INFO L93 Difference]: Finished difference Result 344131 states and 428096 transitions. [2018-01-30 05:38:32,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:32,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-01-30 05:38:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:32,400 INFO L225 Difference]: With dead ends: 344131 [2018-01-30 05:38:32,400 INFO L226 Difference]: Without dead ends: 344129 [2018-01-30 05:38:32,450 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:38:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344129 states. [2018-01-30 05:38:35,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344129 to 294975. [2018-01-30 05:38:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294975 states. [2018-01-30 05:38:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294975 states to 294975 states and 368702 transitions. [2018-01-30 05:38:35,978 INFO L78 Accepts]: Start accepts. Automaton has 294975 states and 368702 transitions. Word has length 110 [2018-01-30 05:38:35,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:35,979 INFO L432 AbstractCegarLoop]: Abstraction has 294975 states and 368702 transitions. [2018-01-30 05:38:35,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 294975 states and 368702 transitions. [2018-01-30 05:38:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-01-30 05:38:36,028 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:36,028 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, 1, 1, 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:38:36,028 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation]=== [2018-01-30 05:38:36,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1701292733, now seen corresponding path program 1 times [2018-01-30 05:38:36,028 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:36,028 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:36,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:36,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:36,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:36,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:36,087 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:38:36,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:36,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:36,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:36,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:36,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:36,088 INFO L87 Difference]: Start difference. First operand 294975 states and 368702 transitions. Second operand 3 states. [2018-01-30 05:38:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:41,031 INFO L93 Difference]: Finished difference Result 872515 states and 1089600 transitions. [2018-01-30 05:38:41,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:41,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-01-30 05:38:41,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:41,883 INFO L225 Difference]: With dead ends: 872515 [2018-01-30 05:38:41,883 INFO L226 Difference]: Without dead ends: 577601 [2018-01-30 05:38:41,968 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:38:42,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577601 states. [2018-01-30 05:38:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577601 to 577599. [2018-01-30 05:38:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577599 states. [2018-01-30 05:38:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577599 states to 577599 states and 712766 transitions. [2018-01-30 05:38:51,904 INFO L78 Accepts]: Start accepts. Automaton has 577599 states and 712766 transitions. Word has length 110 [2018-01-30 05:38:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 05:38:51,904 INFO L432 AbstractCegarLoop]: Abstraction has 577599 states and 712766 transitions. [2018-01-30 05:38:51,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 05:38:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 577599 states and 712766 transitions. [2018-01-30 05:38:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-30 05:38:52,001 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 05:38:52,001 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, 1, 1, 1, 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:38:52,001 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation]=== [2018-01-30 05:38:52,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1056406062, now seen corresponding path program 1 times [2018-01-30 05:38:52,001 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 05:38:52,001 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 05:38:52,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:52,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 05:38:52,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 05:38:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 05:38:52,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 05:38:52,043 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:38:52,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 05:38:52,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 05:38:52,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 05:38:52,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 05:38:52,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 05:38:52,044 INFO L87 Difference]: Start difference. First operand 577599 states and 712766 transitions. Second operand 3 states. [2018-01-30 05:38:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 05:38:58,861 INFO L93 Difference]: Finished difference Result 667715 states and 811072 transitions. [2018-01-30 05:38:58,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 05:38:58,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-01-30 05:38:58,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 05:38:59,715 INFO L225 Difference]: With dead ends: 667715 [2018-01-30 05:38:59,715 INFO L226 Difference]: Without dead ends: 667713 [2018-01-30 05:38:59,758 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 Received shutdown request... [2018-01-30 05:38:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667713 states. [2018-01-30 05:38:59,948 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 05:38:59,951 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 05:38:59,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 05:38:59 BasicIcfg [2018-01-30 05:38:59,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 05:38:59,952 INFO L168 Benchmark]: Toolchain (without parser) took 56166.38 ms. Allocated memory was 148.9 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 114.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-01-30 05:38:59,952 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 05:38:59,952 INFO L168 Benchmark]: CACSL2BoogieTranslator took 118.88 ms. Allocated memory is still 148.9 MB. Free memory was 113.9 MB in the beginning and 104.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 5.3 GB. [2018-01-30 05:38:59,953 INFO L168 Benchmark]: Boogie Preprocessor took 19.08 ms. Allocated memory is still 148.9 MB. Free memory was 104.1 MB in the beginning and 102.3 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:38:59,953 INFO L168 Benchmark]: RCFGBuilder took 583.38 ms. Allocated memory is still 148.9 MB. Free memory was 102.3 MB in the beginning and 74.2 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. [2018-01-30 05:38:59,953 INFO L168 Benchmark]: IcfgTransformer took 15.38 ms. Allocated memory is still 148.9 MB. Free memory was 74.2 MB in the beginning and 72.5 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:38:59,953 INFO L168 Benchmark]: TraceAbstraction took 55427.11 ms. Allocated memory was 148.9 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 72.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-01-30 05:38:59,954 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.09 ms. Allocated memory is still 148.9 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 118.88 ms. Allocated memory is still 148.9 MB. Free memory was 113.9 MB in the beginning and 104.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 19.08 ms. Allocated memory is still 148.9 MB. Free memory was 104.1 MB in the beginning and 102.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. * RCFGBuilder took 583.38 ms. Allocated memory is still 148.9 MB. Free memory was 102.3 MB in the beginning and 74.2 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. * IcfgTransformer took 15.38 ms. Allocated memory is still 148.9 MB. Free memory was 74.2 MB in the beginning and 72.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55427.11 ms. Allocated memory was 148.9 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 72.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 217]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 217). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 159 locations, 1 error locations. TIMEOUT Result, 55.3s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 24.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6603 SDtfs, 2463 SDslu, 4741 SDs, 0 SdLazy, 130 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=577599occurred in iteration=25, 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: 29.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 106800 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2717 NumberOfCodeBlocks, 2717 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2691 ConstructedInterpolants, 0 QuantifiedInterpolants, 356941 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test_locks_14_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-38-59-959.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test_locks_14_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-38-59-959.csv Completed graceful shutdown